/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_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 18:30:31,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 18:30:31,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 18:30:31,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 18:30:31,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 18:30:31,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 18:30:31,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 18:30:31,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 18:30:31,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 18:30:31,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 18:30:31,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 18:30:31,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 18:30:31,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 18:30:31,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 18:30:31,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 18:30:31,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 18:30:31,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 18:30:31,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 18:30:31,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 18:30:31,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 18:30:31,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 18:30:31,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 18:30:31,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 18:30:31,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 18:30:31,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 18:30:31,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 18:30:31,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 18:30:31,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 18:30:31,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 18:30:31,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 18:30:31,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 18:30:31,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 18:30:31,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 18:30:31,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 18:30:31,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 18:30:31,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 18:30:31,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 18:30:31,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 18:30:31,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 18:30:31,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 18:30:31,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 18:30:31,913 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:30:31,951 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 18:30:31,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 18:30:31,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 18:30:31,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 18:30:31,953 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 18:30:31,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 18:30:31,953 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 18:30:31,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 18:30:31,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 18:30:31,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 18:30:31,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 18:30:31,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 18:30:31,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 18:30:31,956 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 18:30:31,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 18:30:31,956 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 18:30:31,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 18:30:31,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 18:30:31,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 18:30:31,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 18:30:31,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 18:30:31,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 18:30:31,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 18:30:31,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 18:30:31,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 18:30:31,958 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 18:30:31,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 18:30:31,959 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 18:30:31,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 18:30:31,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 18:30:32,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 18:30:32,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 18:30:32,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 18:30:32,241 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 18:30:32,241 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 18:30:32,242 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-09 18:30:32,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade309ed1/78a5902d16b74fa78e260b8ecbbdbda2/FLAG53c2942e6 [2020-10-09 18:30:32,859 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 18:30:32,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-09 18:30:32,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade309ed1/78a5902d16b74fa78e260b8ecbbdbda2/FLAG53c2942e6 [2020-10-09 18:30:33,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade309ed1/78a5902d16b74fa78e260b8ecbbdbda2 [2020-10-09 18:30:33,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 18:30:33,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 18:30:33,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 18:30:33,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 18:30:33,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 18:30:33,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 06:30:33" (1/1) ... [2020-10-09 18:30:33,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfed669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:33, skipping insertion in model container [2020-10-09 18:30:33,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 06:30:33" (1/1) ... [2020-10-09 18:30:33,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 18:30:33,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 18:30:33,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 18:30:33,883 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 18:30:33,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 18:30:34,560 INFO L208 MainTranslator]: Completed translation [2020-10-09 18:30:34,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34 WrapperNode [2020-10-09 18:30:34,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 18:30:34,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 18:30:34,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 18:30:34,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 18:30:34,572 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:30:34" (1/1) ... [2020-10-09 18:30:34,629 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:30:34" (1/1) ... [2020-10-09 18:30:34,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 18:30:34,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 18:30:34,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 18:30:34,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 18:30:34,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (1/1) ... [2020-10-09 18:30:34,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 18:30:34,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 18:30:34,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 18:30:34,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 18:30:34,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (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:30:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 18:30:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 18:30:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-09 18:30:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 18:30:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 18:30:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 18:30:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-09 18:30:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-09 18:30:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 18:30:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 18:30:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 18:30:34,838 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:30:35,438 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 18:30:35,438 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 18:30:35,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 06:30:35 BoogieIcfgContainer [2020-10-09 18:30:35,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 18:30:35,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 18:30:35,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 18:30:35,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 18:30:35,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 06:30:33" (1/3) ... [2020-10-09 18:30:35,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4917f961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 06:30:35, skipping insertion in model container [2020-10-09 18:30:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:30:34" (2/3) ... [2020-10-09 18:30:35,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4917f961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 06:30:35, skipping insertion in model container [2020-10-09 18:30:35,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 06:30:35" (3/3) ... [2020-10-09 18:30:35,448 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-09 18:30:35,459 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 18:30:35,467 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-09 18:30:35,468 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 18:30:35,496 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,497 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,499 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,499 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,500 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,501 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,501 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,501 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,501 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,502 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,502 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,502 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,502 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,502 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,503 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,503 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,503 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,503 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,503 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,504 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,504 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,504 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,504 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,504 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,505 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,505 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,505 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,505 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,506 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,506 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,506 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,506 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,512 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,512 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,513 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,513 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,520 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,521 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,521 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,522 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:30:35,545 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-09 18:30:35,563 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 18:30:35,563 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 18:30:35,563 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 18:30:35,563 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 18:30:35,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 18:30:35,564 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 18:30:35,564 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 18:30:35,564 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 18:30:35,580 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-09 18:30:35,649 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-09 18:30:35,653 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 18:30:35,659 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-09 18:30:35,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 154 transitions, 330 flow [2020-10-09 18:30:35,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 143 transitions, 304 flow [2020-10-09 18:30:35,675 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2020-10-09 18:30:35,675 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 18:30:35,675 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:35,676 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:30:35,677 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:30:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:35,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1462968341, now seen corresponding path program 1 times [2020-10-09 18:30:35,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:35,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180260453] [2020-10-09 18:30:35,699 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:30:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:35,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:30:35,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:35,908 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:30:35,908 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:35,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:35,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:35,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:30:35,953 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-10-09 18:30:35,954 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:30:35,956 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:35,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:35,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:35,962 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-10-09 18:30:35,988 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-10-09 18:30:35,989 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:30:35,991 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:35,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:35,993 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:30:35,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-10-09 18:30:36,028 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:30:36,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:36,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:36,068 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:30:36,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180260453] [2020-10-09 18:30:36,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:36,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2020-10-09 18:30:36,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875186390] [2020-10-09 18:30:36,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 18:30:36,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:36,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 18:30:36,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 18:30:37,242 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 154 [2020-10-09 18:30:37,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 304 flow. Second operand 7 states. [2020-10-09 18:30:37,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:37,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 154 [2020-10-09 18:30:37,246 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:37,502 INFO L129 PetriNetUnfolder]: 132/543 cut-off events. [2020-10-09 18:30:37,503 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-09 18:30:37,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 543 events. 132/543 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2950 event pairs, 128 based on Foata normal form. 14/547 useless extension candidates. Maximal degree in co-relation 661. Up to 260 conditions per place. [2020-10-09 18:30:37,511 INFO L132 encePairwiseOnDemand]: 138/154 looper letters, 30 selfloop transitions, 11 changer transitions 0/139 dead transitions. [2020-10-09 18:30:37,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 378 flow [2020-10-09 18:30:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:30:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:30:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1027 transitions. [2020-10-09 18:30:37,532 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.740981240981241 [2020-10-09 18:30:37,533 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1027 transitions. [2020-10-09 18:30:37,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1027 transitions. [2020-10-09 18:30:37,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:37,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1027 transitions. [2020-10-09 18:30:37,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:30:37,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:30:37,557 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:30:37,560 INFO L185 Difference]: Start difference. First operand has 141 places, 143 transitions, 304 flow. Second operand 9 states and 1027 transitions. [2020-10-09 18:30:37,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 378 flow [2020-10-09 18:30:37,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 366 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 18:30:37,574 INFO L241 Difference]: Finished difference. Result has 144 places, 139 transitions, 318 flow [2020-10-09 18:30:37,577 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2020-10-09 18:30:37,578 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, 3 predicate places. [2020-10-09 18:30:37,578 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 318 flow [2020-10-09 18:30:37,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 18:30:37,578 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:37,579 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:30:37,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 18:30:37,791 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:30:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1084695127, now seen corresponding path program 1 times [2020-10-09 18:30:37,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:37,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342753133] [2020-10-09 18:30:37,795 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:30:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:37,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 18:30:37,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:37,890 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:30:37,891 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:37,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:37,893 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:37,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:30:37,921 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:30:37,922 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:37,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:37,924 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:30:37,925 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:30:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 18:30:37,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:37,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:37,992 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:30:37,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342753133] [2020-10-09 18:30:37,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:37,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-09 18:30:37,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738739606] [2020-10-09 18:30:37,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 18:30:37,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 18:30:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-09 18:30:38,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 154 [2020-10-09 18:30:38,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 318 flow. Second operand 6 states. [2020-10-09 18:30:38,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:38,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 154 [2020-10-09 18:30:38,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:38,982 INFO L129 PetriNetUnfolder]: 132/498 cut-off events. [2020-10-09 18:30:38,982 INFO L130 PetriNetUnfolder]: For 46/50 co-relation queries the response was YES. [2020-10-09 18:30:38,985 INFO L80 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 498 events. 132/498 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2593 event pairs, 32 based on Foata normal form. 3/494 useless extension candidates. Maximal degree in co-relation 703. Up to 168 conditions per place. [2020-10-09 18:30:38,990 INFO L132 encePairwiseOnDemand]: 141/154 looper letters, 39 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2020-10-09 18:30:38,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 149 transitions, 446 flow [2020-10-09 18:30:38,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:30:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:30:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1042 transitions. [2020-10-09 18:30:38,996 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7518037518037518 [2020-10-09 18:30:38,996 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1042 transitions. [2020-10-09 18:30:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1042 transitions. [2020-10-09 18:30:38,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:38,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1042 transitions. [2020-10-09 18:30:39,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:30:39,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:30:39,025 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:30:39,026 INFO L185 Difference]: Start difference. First operand has 144 places, 139 transitions, 318 flow. Second operand 9 states and 1042 transitions. [2020-10-09 18:30:39,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 149 transitions, 446 flow [2020-10-09 18:30:39,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 430 flow, removed 0 selfloop flow, removed 7 redundant places. [2020-10-09 18:30:39,037 INFO L241 Difference]: Finished difference. Result has 145 places, 139 transitions, 339 flow [2020-10-09 18:30:39,038 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=339, PETRI_PLACES=145, PETRI_TRANSITIONS=139} [2020-10-09 18:30:39,039 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, 4 predicate places. [2020-10-09 18:30:39,039 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 139 transitions, 339 flow [2020-10-09 18:30:39,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 18:30:39,044 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:39,044 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:30:39,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 18:30:39,260 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:30:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1692348281, now seen corresponding path program 1 times [2020-10-09 18:30:39,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:39,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131766961] [2020-10-09 18:30:39,261 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:30:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:39,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:30:39,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:39,378 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:30:39,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:39,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:39,381 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:39,382 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:30:39,400 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-10-09 18:30:39,401 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:30:39,402 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:39,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:39,408 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:39,408 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-09 18:30:39,427 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-10-09 18:30:39,428 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:30:39,429 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:39,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:39,431 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:30:39,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2020-10-09 18:30:39,454 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:30:39,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:39,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 18:30:39,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131766961] [2020-10-09 18:30:39,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:39,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2020-10-09 18:30:39,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534041211] [2020-10-09 18:30:39,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 18:30:39,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 18:30:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 18:30:40,838 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 154 [2020-10-09 18:30:40,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 139 transitions, 339 flow. Second operand 7 states. [2020-10-09 18:30:40,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:40,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 154 [2020-10-09 18:30:40,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:41,280 INFO L129 PetriNetUnfolder]: 316/1033 cut-off events. [2020-10-09 18:30:41,281 INFO L130 PetriNetUnfolder]: For 151/155 co-relation queries the response was YES. [2020-10-09 18:30:41,284 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 1033 events. 316/1033 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6730 event pairs, 56 based on Foata normal form. 18/1044 useless extension candidates. Maximal degree in co-relation 563. Up to 324 conditions per place. [2020-10-09 18:30:41,290 INFO L132 encePairwiseOnDemand]: 141/154 looper letters, 64 selfloop transitions, 43 changer transitions 0/203 dead transitions. [2020-10-09 18:30:41,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 203 transitions, 719 flow [2020-10-09 18:30:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 18:30:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-09 18:30:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1602 transitions. [2020-10-09 18:30:41,296 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7430426716141002 [2020-10-09 18:30:41,296 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1602 transitions. [2020-10-09 18:30:41,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1602 transitions. [2020-10-09 18:30:41,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:41,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1602 transitions. [2020-10-09 18:30:41,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-09 18:30:41,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-09 18:30:41,305 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-09 18:30:41,306 INFO L185 Difference]: Start difference. First operand has 145 places, 139 transitions, 339 flow. Second operand 14 states and 1602 transitions. [2020-10-09 18:30:41,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 203 transitions, 719 flow [2020-10-09 18:30:41,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 203 transitions, 700 flow, removed 0 selfloop flow, removed 6 redundant places. [2020-10-09 18:30:41,313 INFO L241 Difference]: Finished difference. Result has 156 places, 199 transitions, 652 flow [2020-10-09 18:30:41,314 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=652, PETRI_PLACES=156, PETRI_TRANSITIONS=199} [2020-10-09 18:30:41,314 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, 15 predicate places. [2020-10-09 18:30:41,314 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 199 transitions, 652 flow [2020-10-09 18:30:41,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 18:30:41,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:41,315 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:30:41,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 18:30:41,528 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:30:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1330747333, now seen corresponding path program 1 times [2020-10-09 18:30:41,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:41,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345947775] [2020-10-09 18:30:41,531 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:30:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:41,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 18:30:41,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:41,616 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:30:41,617 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:41,619 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:41,619 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:41,619 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:30:41,629 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:30:41,630 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:41,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:41,631 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:30:41,632 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-10-09 18:30:41,653 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:30:41,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:41,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:41,695 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:30:41,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345947775] [2020-10-09 18:30:41,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:41,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-09 18:30:41,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933063636] [2020-10-09 18:30:41,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 18:30:41,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 18:30:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-09 18:30:42,481 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 154 [2020-10-09 18:30:42,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 199 transitions, 652 flow. Second operand 6 states. [2020-10-09 18:30:42,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:42,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 154 [2020-10-09 18:30:42,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:42,847 INFO L129 PetriNetUnfolder]: 462/1364 cut-off events. [2020-10-09 18:30:42,848 INFO L130 PetriNetUnfolder]: For 667/673 co-relation queries the response was YES. [2020-10-09 18:30:42,854 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 1364 events. 462/1364 cut-off events. For 667/673 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9528 event pairs, 56 based on Foata normal form. 26/1383 useless extension candidates. Maximal degree in co-relation 3012. Up to 502 conditions per place. [2020-10-09 18:30:42,861 INFO L132 encePairwiseOnDemand]: 145/154 looper letters, 71 selfloop transitions, 26 changer transitions 66/260 dead transitions. [2020-10-09 18:30:42,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 260 transitions, 1244 flow [2020-10-09 18:30:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:30:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:30:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1049 transitions. [2020-10-09 18:30:42,865 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2020-10-09 18:30:42,865 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1049 transitions. [2020-10-09 18:30:42,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1049 transitions. [2020-10-09 18:30:42,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:42,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1049 transitions. [2020-10-09 18:30:42,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:30:42,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:30:42,874 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:30:42,874 INFO L185 Difference]: Start difference. First operand has 156 places, 199 transitions, 652 flow. Second operand 9 states and 1049 transitions. [2020-10-09 18:30:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 260 transitions, 1244 flow [2020-10-09 18:30:42,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 260 transitions, 1210 flow, removed 17 selfloop flow, removed 0 redundant places. [2020-10-09 18:30:42,889 INFO L241 Difference]: Finished difference. Result has 171 places, 190 transitions, 720 flow [2020-10-09 18:30:42,890 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=171, PETRI_TRANSITIONS=190} [2020-10-09 18:30:42,890 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, 30 predicate places. [2020-10-09 18:30:42,890 INFO L481 AbstractCegarLoop]: Abstraction has has 171 places, 190 transitions, 720 flow [2020-10-09 18:30:42,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 18:30:42,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:42,890 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] [2020-10-09 18:30:43,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 18:30:43,111 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:30:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1902372337, now seen corresponding path program 1 times [2020-10-09 18:30:43,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:43,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86502368] [2020-10-09 18:30:43,113 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:30:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:43,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:30:43,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:43,228 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:30:43,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:43,238 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:30:43,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86502368] [2020-10-09 18:30:43,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:43,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-10-09 18:30:43,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622758364] [2020-10-09 18:30:43,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 18:30:43,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:43,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 18:30:43,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-09 18:30:43,332 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 154 [2020-10-09 18:30:43,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 190 transitions, 720 flow. Second operand 5 states. [2020-10-09 18:30:43,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:43,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 154 [2020-10-09 18:30:43,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:43,385 INFO L129 PetriNetUnfolder]: 6/153 cut-off events. [2020-10-09 18:30:43,385 INFO L130 PetriNetUnfolder]: For 90/98 co-relation queries the response was YES. [2020-10-09 18:30:43,386 INFO L80 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 153 events. 6/153 cut-off events. For 90/98 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 276 event pairs, 4 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 241. Up to 14 conditions per place. [2020-10-09 18:30:43,387 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2020-10-09 18:30:43,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 115 transitions, 314 flow [2020-10-09 18:30:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 18:30:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-09 18:30:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2020-10-09 18:30:43,390 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9058441558441559 [2020-10-09 18:30:43,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2020-10-09 18:30:43,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2020-10-09 18:30:43,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:43,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2020-10-09 18:30:43,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-09 18:30:43,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-09 18:30:43,395 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-09 18:30:43,395 INFO L185 Difference]: Start difference. First operand has 171 places, 190 transitions, 720 flow. Second operand 6 states and 837 transitions. [2020-10-09 18:30:43,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 115 transitions, 314 flow [2020-10-09 18:30:43,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 115 transitions, 272 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-09 18:30:43,398 INFO L241 Difference]: Finished difference. Result has 130 places, 115 transitions, 264 flow [2020-10-09 18:30:43,399 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2020-10-09 18:30:43,399 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, -11 predicate places. [2020-10-09 18:30:43,399 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 264 flow [2020-10-09 18:30:43,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 18:30:43,399 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:43,399 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, 1, 1, 1, 1, 1, 1] [2020-10-09 18:30:43,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 18:30:43,612 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:30:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1821742821, now seen corresponding path program 1 times [2020-10-09 18:30:43,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:43,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560539038] [2020-10-09 18:30:43,614 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:30:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:43,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 18:30:43,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:43,787 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:30:43,788 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:43,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:30:43,860 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:43,861 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:30:43,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:30:43,865 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:43,870 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,870 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-10-09 18:30:43,931 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:30:43,932 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:43,939 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,940 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:30:43,972 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:30:43,973 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:30:43,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:43,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:43,981 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:30:43,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2020-10-09 18:30:44,009 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:30:44,010 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:44,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:44,015 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:44,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-10-09 18:30:44,029 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:30:44,030 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:44,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:44,036 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:30:44,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:30:44,068 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:30:44,069 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:44,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:44,072 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:30:44,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:30:44,151 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:30:44,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:30:44,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:44,202 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:30:44,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:44,210 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:30:44,211 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2020-10-09 18:30:44,287 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:44,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:44,290 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:30:44,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-10-09 18:30:45,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 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_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:30:51,092 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 25 [2020-10-09 18:30:51,102 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:30:51,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:30:51,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:30:51,129 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 18:30:51,370 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2020-10-09 18:30:51,370 INFO L625 ElimStorePlain]: treesize reduction 1072, result has 4.6 percent of original size [2020-10-09 18:30:51,377 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:30:51,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2020-10-09 18:30:51,391 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:30:52,784 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:30:52,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560539038] [2020-10-09 18:30:52,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:30:52,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 23 [2020-10-09 18:30:52,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560554092] [2020-10-09 18:30:52,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 18:30:52,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:30:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 18:30:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=4, NotChecked=40, Total=506 [2020-10-09 18:30:52,859 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 154 [2020-10-09 18:30:52,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 264 flow. Second operand 23 states. [2020-10-09 18:30:52,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:30:52,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 154 [2020-10-09 18:30:52,861 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:30:54,424 INFO L129 PetriNetUnfolder]: 588/1502 cut-off events. [2020-10-09 18:30:54,424 INFO L130 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2020-10-09 18:30:54,428 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 1502 events. 588/1502 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9349 event pairs, 28 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 2896. Up to 359 conditions per place. [2020-10-09 18:30:54,435 INFO L132 encePairwiseOnDemand]: 136/154 looper letters, 134 selfloop transitions, 27 changer transitions 0/211 dead transitions. [2020-10-09 18:30:54,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 826 flow [2020-10-09 18:30:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-09 18:30:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-09 18:30:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1546 transitions. [2020-10-09 18:30:54,443 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.4780457637600495 [2020-10-09 18:30:54,443 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1546 transitions. [2020-10-09 18:30:54,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1546 transitions. [2020-10-09 18:30:54,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:30:54,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1546 transitions. [2020-10-09 18:30:54,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 22 states. [2020-10-09 18:30:54,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 22 states. [2020-10-09 18:30:54,454 INFO L81 ComplementDD]: Finished complementDD. Result 22 states. [2020-10-09 18:30:54,454 INFO L185 Difference]: Start difference. First operand has 130 places, 115 transitions, 264 flow. Second operand 21 states and 1546 transitions. [2020-10-09 18:30:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 826 flow [2020-10-09 18:30:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 211 transitions, 819 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 18:30:54,461 INFO L241 Difference]: Finished difference. Result has 159 places, 135 transitions, 427 flow [2020-10-09 18:30:54,461 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=427, PETRI_PLACES=159, PETRI_TRANSITIONS=135} [2020-10-09 18:30:54,462 INFO L341 CegarLoopForPetriNet]: 141 programPoint places, 18 predicate places. [2020-10-09 18:30:54,462 INFO L481 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 427 flow [2020-10-09 18:30:54,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 18:30:54,462 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:30:54,462 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, 1, 1, 1, 1, 1, 1] [2020-10-09 18:30:54,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 18:30:54,677 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:30:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:30:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1032817137, now seen corresponding path program 1 times [2020-10-09 18:30:54,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:30:54,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231588920] [2020-10-09 18:30:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:30:54,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-09 18:30:54,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:30:54,866 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:30:54,867 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:54,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:30:54,895 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:54,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 18:30:54,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:30:54,899 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,913 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-10-09 18:30:54,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,914 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2020-10-09 18:30:54,933 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:54,934 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 18:30:54,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 18:30:54,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:30:54,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:54,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:54,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-10-09 18:30:54,997 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-09 18:30:54,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,004 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:30:55,031 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 18:30:55,032 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,040 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:30:55,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-09 18:30:55,270 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2020-10-09 18:30:55,271 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,285 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:30:55,286 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2020-10-09 18:30:55,351 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:30:55,352 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2020-10-09 18:30:55,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,367 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 18:30:55,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:39 [2020-10-09 18:30:55,629 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,630 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 68 [2020-10-09 18:30:55,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,674 INFO L625 ElimStorePlain]: treesize reduction 26, result has 64.9 percent of original size [2020-10-09 18:30:55,677 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 18:30:55,678 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2020-10-09 18:30:55,791 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:30:55,791 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2020-10-09 18:30:55,792 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,833 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 18:30:55,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:39 [2020-10-09 18:30:55,958 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-10-09 18:30:55,960 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:30:55,968 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:30:55,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:7 [2020-10-09 18:30:56,090 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:30:56,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:27,108 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 18:31:29,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork1_#t~mem31| Int) (my_callbackThread1of1ForFork0_~data~0.offset Int) (my_callbackThread1of1ForFork1_~data~0.offset Int) (|my_callbackThread1of1ForFork0_#t~mem31| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| c_my_callbackThread1of1ForFork0_~data~0.base (store (store (select |c_#memory_int| c_my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem31| 1))))) (store .cse0 c_~my_dev~0.base (store (store (select .cse0 c_~my_dev~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem31| 1)))) |c_~#t1~0.base|) |c_~#t1~0.offset|) c_my_callbackThread1of1ForFork1_thidvar0)) is different from false [2020-10-09 18:32:06,600 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-09 18:32:08,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork1_#t~mem31| Int) (my_callbackThread1of1ForFork0_~data~0.offset Int) (my_callbackThread1of1ForFork1_~data~0.offset Int) (|my_callbackThread1of1ForFork0_#t~mem31| Int) (|~#t2~0.offset| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_~#t2~0.base| (store (select |c_#memory_int| |c_~#t2~0.base|) |~#t2~0.offset| 1)))) (store .cse0 c_~my_dev~0.base (store (store (store (store (select .cse0 c_~my_dev~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem31| 1)) (+ my_callbackThread1of1ForFork1_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem31| 1)))) |c_~#t1~0.base|) |c_~#t1~0.offset|) 1)) is different from false [2020-10-09 18:32:08,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:10,020 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 362 DAG size of output: 47 [2020-10-09 18:32:10,022 INFO L625 ElimStorePlain]: treesize reduction 36766, result has 0.2 percent of original size [2020-10-09 18:32:10,029 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-09 18:32:10,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:84, output treesize:9 [2020-10-09 18:32:10,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:10,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:10,548 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:10,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231588920] [2020-10-09 18:32:10,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:32:10,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 20] imperfect sequences [] total 38 [2020-10-09 18:32:10,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526218423] [2020-10-09 18:32:10,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-10-09 18:32:10,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:32:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-10-09 18:32:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1108, Unknown=28, NotChecked=138, Total=1406 [2020-10-09 18:32:11,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 154 [2020-10-09 18:32:11,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 135 transitions, 427 flow. Second operand 38 states. [2020-10-09 18:32:11,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:32:11,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 154 [2020-10-09 18:32:11,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:32:21,117 WARN L193 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 18:32:26,867 WARN L193 SmtUtils]: Spent 3.65 s on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 18:32:58,384 WARN L193 SmtUtils]: Spent 9.56 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-10-09 18:33:06,860 WARN L193 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2020-10-09 18:33:37,563 WARN L193 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2020-10-09 18:34:03,899 WARN L193 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-10-09 18:34:16,340 WARN L193 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-10-09 18:34:30,145 WARN L193 SmtUtils]: Spent 10.32 s on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-10-09 18:34:54,656 WARN L193 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-10-09 18:35:38,243 WARN L193 SmtUtils]: Spent 10.41 s on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-10-09 18:36:18,831 WARN L193 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-10-09 18:37:00,678 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2020-10-09 18:38:14,545 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 18:38:16,716 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-10-09 18:38:24,387 WARN L193 SmtUtils]: Spent 7.47 s on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2020-10-09 18:39:09,041 WARN L193 SmtUtils]: Spent 8.32 s on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-09 18:39:30,698 WARN L193 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2020-10-09 18:39:59,933 WARN L193 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2020-10-09 18:40:44,900 WARN L193 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-10-09 18:40:49,908 WARN L193 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-10-09 18:41:30,563 WARN L193 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-10-09 18:41:45,018 WARN L193 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-10-09 18:42:29,975 WARN L193 SmtUtils]: Spent 10.51 s on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2020-10-09 18:43:57,979 WARN L193 SmtUtils]: Spent 10.28 s on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-10-09 18:44:15,695 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-09 18:44:15,906 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-10-09 18:44:48,496 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 18:44:59,105 WARN L193 SmtUtils]: Spent 8.31 s on a formula simplification. DAG size of input: 75 DAG size of output: 74 Received shutdown request... [2020-10-09 18:45:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-10-09 18:45:15,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 18:45:15,647 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 18:45:15,653 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 18:45:15,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 06:45:15 BasicIcfg [2020-10-09 18:45:15,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 18:45:15,655 INFO L168 Benchmark]: Toolchain (without parser) took 882600.37 ms. Allocated memory was 250.1 MB in the beginning and 566.2 MB in the end (delta: 316.1 MB). Free memory was 200.8 MB in the beginning and 204.4 MB in the end (delta: -3.6 MB). Peak memory consumption was 312.6 MB. Max. memory is 14.2 GB. [2020-10-09 18:45:15,655 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 250.1 MB. Free memory is still 224.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 18:45:15,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1506.48 ms. Allocated memory was 250.1 MB in the beginning and 353.9 MB in the end (delta: 103.8 MB). Free memory was 200.8 MB in the beginning and 316.7 MB in the end (delta: -115.9 MB). Peak memory consumption was 108.0 MB. Max. memory is 14.2 GB. [2020-10-09 18:45:15,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.41 ms. Allocated memory is still 353.9 MB. Free memory was 316.7 MB in the beginning and 313.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 18:45:15,656 INFO L168 Benchmark]: Boogie Preprocessor took 84.72 ms. Allocated memory is still 353.9 MB. Free memory is still 313.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 18:45:15,657 INFO L168 Benchmark]: RCFGBuilder took 674.77 ms. Allocated memory is still 353.9 MB. Free memory was 313.3 MB in the beginning and 262.4 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 14.2 GB. [2020-10-09 18:45:15,657 INFO L168 Benchmark]: TraceAbstraction took 880212.02 ms. Allocated memory was 353.9 MB in the beginning and 566.2 MB in the end (delta: 212.3 MB). Free memory was 262.4 MB in the beginning and 204.4 MB in the end (delta: 58.0 MB). Peak memory consumption was 270.4 MB. Max. memory is 14.2 GB. [2020-10-09 18:45:15,659 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 250.1 MB. Free memory is still 224.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1506.48 ms. Allocated memory was 250.1 MB in the beginning and 353.9 MB in the end (delta: 103.8 MB). Free memory was 200.8 MB in the beginning and 316.7 MB in the end (delta: -115.9 MB). Peak memory consumption was 108.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 117.41 ms. Allocated memory is still 353.9 MB. Free memory was 316.7 MB in the beginning and 313.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 84.72 ms. Allocated memory is still 353.9 MB. Free memory is still 313.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 674.77 ms. Allocated memory is still 353.9 MB. Free memory was 313.3 MB in the beginning and 262.4 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 880212.02 ms. Allocated memory was 353.9 MB in the beginning and 566.2 MB in the end (delta: 212.3 MB). Free memory was 262.4 MB in the beginning and 204.4 MB in the end (delta: 58.0 MB). Peak memory consumption was 270.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 79 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 880.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 792.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 169 SDtfs, 1817 SDslu, 2230 SDs, 0 SdLazy, 3106 SolverSat, 264 SolverUnsat, 204 SolverUnknown, 0 SolverNotchecked, 437.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 794 SyntacticMatches, 52 SemanticMatches, 162 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 423.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 85.3s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 914 ConstructedInterpolants, 148 QuantifiedInterpolants, 764124 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1105 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown