/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/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:43:23,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:43:23,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:43:23,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:43:23,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:43:23,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:43:23,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:43:23,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:43:23,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:43:23,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:43:23,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:43:23,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:43:23,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:43:23,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:43:23,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:43:23,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:43:23,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:43:23,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:43:23,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:43:23,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:43:23,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:43:23,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:43:23,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:43:23,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:43:23,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:43:23,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:43:23,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:43:23,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:43:23,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:43:23,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:43:23,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:43:23,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:43:23,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:43:23,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:43:23,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:43:23,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:43:23,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:43:23,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:43:23,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:43:23,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:43:23,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:43:23,635 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 14:43:23,658 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:43:23,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:43:23,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:43:23,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:43:23,660 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:43:23,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:43:23,661 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:43:23,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:43:23,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:43:23,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:43:23,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:43:23,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:43:23,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:43:23,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:43:23,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:43:23,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:43:23,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:43:23,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:43:23,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:43:23,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:43:23,664 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:43:23,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:43:23,665 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:43:23,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:43:23,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:43:23,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:43:24,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:43:24,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:43:24,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:43:24,020 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:43:24,021 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2020-10-09 14:43:24,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ac6f72/66772d5fef2c4bcc9f9a3127d09a3bde/FLAG9006b57e3 [2020-10-09 14:43:24,726 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:43:24,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2020-10-09 14:43:24,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ac6f72/66772d5fef2c4bcc9f9a3127d09a3bde/FLAG9006b57e3 [2020-10-09 14:43:24,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ac6f72/66772d5fef2c4bcc9f9a3127d09a3bde [2020-10-09 14:43:24,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:43:24,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:43:24,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:43:24,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:43:24,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:43:24,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:43:24" (1/1) ... [2020-10-09 14:43:24,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1fd713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:24, skipping insertion in model container [2020-10-09 14:43:24,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:43:24" (1/1) ... [2020-10-09 14:43:24,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:43:25,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:43:25,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:43:25,739 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:43:25,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:43:25,956 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:43:25,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25 WrapperNode [2020-10-09 14:43:25,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:43:25,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:43:25,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:43:25,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:43:25,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:25,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:43:26,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:43:26,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:43:26,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:43:26,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (1/1) ... [2020-10-09 14:43:26,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:43:26,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:43:26,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:43:26,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:43:26,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (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 14:43:26,189 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:43:26,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:43:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:43:26,190 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:43:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:43:26,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:43:26,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 14:43:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:43:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-09 14:43:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 14:43:26,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:43:26,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:43:26,196 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 14:43:26,702 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:43:26,702 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 14:43:26,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:43:26 BoogieIcfgContainer [2020-10-09 14:43:26,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:43:26,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:43:26,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:43:26,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:43:26,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:43:24" (1/3) ... [2020-10-09 14:43:26,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7016fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:43:26, skipping insertion in model container [2020-10-09 14:43:26,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:43:25" (2/3) ... [2020-10-09 14:43:26,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7016fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:43:26, skipping insertion in model container [2020-10-09 14:43:26,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:43:26" (3/3) ... [2020-10-09 14:43:26,723 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2020-10-09 14:43:26,732 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:43:26,741 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 14:43:26,742 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:43:26,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,787 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,787 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,789 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,792 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,792 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,795 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,795 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,795 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,796 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,796 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,796 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,796 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,796 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,797 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,797 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,797 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,798 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,798 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,798 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,798 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,799 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,799 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,799 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,799 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,800 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,807 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,812 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,812 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,812 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,812 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,814 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,814 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,820 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,820 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,820 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,821 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,824 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,824 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,834 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,834 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,835 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,835 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,835 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,835 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,836 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,836 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,836 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,836 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,836 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,837 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,837 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,837 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,838 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,838 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,838 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,838 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:43:26,864 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 14:43:26,887 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:43:26,888 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:43:26,888 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:43:26,888 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:43:26,888 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:43:26,889 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:43:26,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:43:26,889 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:43:26,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 142 transitions, 306 flow [2020-10-09 14:43:26,997 INFO L129 PetriNetUnfolder]: 11/142 cut-off events. [2020-10-09 14:43:27,001 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 14:43:27,013 INFO L80 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 142 events. 11/142 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-10-09 14:43:27,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 142 transitions, 306 flow [2020-10-09 14:43:27,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 130 transitions, 272 flow [2020-10-09 14:43:27,074 INFO L129 PetriNetUnfolder]: 6/105 cut-off events. [2020-10-09 14:43:27,074 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 14:43:27,075 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:27,077 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] [2020-10-09 14:43:27,078 INFO L429 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1747143968, now seen corresponding path program 1 times [2020-10-09 14:43:27,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:27,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907289618] [2020-10-09 14:43:27,112 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 14:43:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:27,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:43:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:27,347 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 14:43:27,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:27,374 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 14:43:27,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907289618] [2020-10-09 14:43:27,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:43:27,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 14:43:27,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123967584] [2020-10-09 14:43:27,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 14:43:27,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 14:43:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 14:43:27,528 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 142 [2020-10-09 14:43:27,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 272 flow. Second operand 3 states. [2020-10-09 14:43:27,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:27,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 142 [2020-10-09 14:43:27,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:43:27,690 INFO L129 PetriNetUnfolder]: 28/480 cut-off events. [2020-10-09 14:43:27,690 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 14:43:27,696 INFO L80 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 480 events. 28/480 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2007 event pairs, 2 based on Foata normal form. 45/489 useless extension candidates. Maximal degree in co-relation 487. Up to 23 conditions per place. [2020-10-09 14:43:27,700 INFO L132 encePairwiseOnDemand]: 131/142 looper letters, 7 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2020-10-09 14:43:27,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 129 transitions, 292 flow [2020-10-09 14:43:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:43:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:43:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2020-10-09 14:43:27,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9694835680751174 [2020-10-09 14:43:27,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2020-10-09 14:43:27,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2020-10-09 14:43:27,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:43:27,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2020-10-09 14:43:27,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:43:27,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:43:27,744 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:43:27,747 INFO L185 Difference]: Start difference. First operand has 126 places, 130 transitions, 272 flow. Second operand 3 states and 413 transitions. [2020-10-09 14:43:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 129 transitions, 292 flow [2020-10-09 14:43:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 129 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 14:43:27,759 INFO L241 Difference]: Finished difference. Result has 126 places, 129 transitions, 290 flow [2020-10-09 14:43:27,763 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=126, PETRI_TRANSITIONS=129} [2020-10-09 14:43:27,764 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2020-10-09 14:43:27,764 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 129 transitions, 290 flow [2020-10-09 14:43:27,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 14:43:27,765 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:27,765 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] [2020-10-09 14:43:27,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:43:27,977 INFO L429 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash -187171161, now seen corresponding path program 1 times [2020-10-09 14:43:27,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:27,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798794991] [2020-10-09 14:43:27,979 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 14:43:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:28,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:43:28,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:28,101 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 14:43:28,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:28,123 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 14:43:28,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798794991] [2020-10-09 14:43:28,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:43:28,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:43:28,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311221466] [2020-10-09 14:43:28,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:43:28,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:43:28,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:43:28,216 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 142 [2020-10-09 14:43:28,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 129 transitions, 290 flow. Second operand 4 states. [2020-10-09 14:43:28,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:28,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 142 [2020-10-09 14:43:28,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:43:28,365 INFO L129 PetriNetUnfolder]: 28/596 cut-off events. [2020-10-09 14:43:28,365 INFO L130 PetriNetUnfolder]: For 87/129 co-relation queries the response was YES. [2020-10-09 14:43:28,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 596 events. 28/596 cut-off events. For 87/129 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2081 event pairs, 0 based on Foata normal form. 10/567 useless extension candidates. Maximal degree in co-relation 621. Up to 36 conditions per place. [2020-10-09 14:43:28,376 INFO L132 encePairwiseOnDemand]: 136/142 looper letters, 9 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2020-10-09 14:43:28,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 131 transitions, 324 flow [2020-10-09 14:43:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:43:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:43:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2020-10-09 14:43:28,380 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413145539906104 [2020-10-09 14:43:28,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2020-10-09 14:43:28,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2020-10-09 14:43:28,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:43:28,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2020-10-09 14:43:28,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:43:28,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:43:28,385 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:43:28,385 INFO L185 Difference]: Start difference. First operand has 126 places, 129 transitions, 290 flow. Second operand 3 states and 401 transitions. [2020-10-09 14:43:28,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 131 transitions, 324 flow [2020-10-09 14:43:28,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 14:43:28,393 INFO L241 Difference]: Finished difference. Result has 128 places, 131 transitions, 314 flow [2020-10-09 14:43:28,393 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=128, PETRI_TRANSITIONS=131} [2020-10-09 14:43:28,394 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 2 predicate places. [2020-10-09 14:43:28,394 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 131 transitions, 314 flow [2020-10-09 14:43:28,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:43:28,395 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:28,395 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] [2020-10-09 14:43:28,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:43:28,611 INFO L429 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -323937217, now seen corresponding path program 1 times [2020-10-09 14:43:28,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:28,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498336624] [2020-10-09 14:43:28,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 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 14:43:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:28,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 14:43:28,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:28,792 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 14:43:28,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:28,829 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 14:43:28,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498336624] [2020-10-09 14:43:28,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:43:28,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-09 14:43:28,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471921212] [2020-10-09 14:43:28,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:43:28,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:43:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:43:28,913 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 142 [2020-10-09 14:43:28,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 131 transitions, 314 flow. Second operand 4 states. [2020-10-09 14:43:28,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:28,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 142 [2020-10-09 14:43:28,914 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:43:29,072 INFO L129 PetriNetUnfolder]: 28/584 cut-off events. [2020-10-09 14:43:29,073 INFO L130 PetriNetUnfolder]: For 38/55 co-relation queries the response was YES. [2020-10-09 14:43:29,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 584 events. 28/584 cut-off events. For 38/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2018 event pairs, 0 based on Foata normal form. 4/558 useless extension candidates. Maximal degree in co-relation 632. Up to 37 conditions per place. [2020-10-09 14:43:29,083 INFO L132 encePairwiseOnDemand]: 137/142 looper letters, 7 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2020-10-09 14:43:29,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 342 flow [2020-10-09 14:43:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 14:43:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-09 14:43:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2020-10-09 14:43:29,087 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9295774647887324 [2020-10-09 14:43:29,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2020-10-09 14:43:29,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2020-10-09 14:43:29,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:43:29,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2020-10-09 14:43:29,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-09 14:43:29,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-09 14:43:29,093 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-09 14:43:29,094 INFO L185 Difference]: Start difference. First operand has 128 places, 131 transitions, 314 flow. Second operand 4 states and 528 transitions. [2020-10-09 14:43:29,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 342 flow [2020-10-09 14:43:29,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 330 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-09 14:43:29,102 INFO L241 Difference]: Finished difference. Result has 131 places, 134 transitions, 330 flow [2020-10-09 14:43:29,103 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2020-10-09 14:43:29,103 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2020-10-09 14:43:29,103 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 330 flow [2020-10-09 14:43:29,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:43:29,104 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:29,104 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] [2020-10-09 14:43:29,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 14:43:29,318 INFO L429 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 725750575, now seen corresponding path program 1 times [2020-10-09 14:43:29,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:29,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869447751] [2020-10-09 14:43:29,321 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 14:43:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:29,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:43:29,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:29,500 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 11 treesize of output 7 [2020-10-09 14:43:29,501 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:43:29,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:43:29,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:43:29,507 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-09 14:43:29,537 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 14:43:29,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:29,569 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 14:43:29,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869447751] [2020-10-09 14:43:29,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:43:29,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:43:29,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405299600] [2020-10-09 14:43:29,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:43:29,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:43:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:43:29,684 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 142 [2020-10-09 14:43:29,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 330 flow. Second operand 4 states. [2020-10-09 14:43:29,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:29,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 142 [2020-10-09 14:43:29,685 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:43:29,806 INFO L129 PetriNetUnfolder]: 14/403 cut-off events. [2020-10-09 14:43:29,807 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 14:43:29,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 403 events. 14/403 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1144 event pairs, 0 based on Foata normal form. 11/393 useless extension candidates. Maximal degree in co-relation 424. Up to 15 conditions per place. [2020-10-09 14:43:29,813 INFO L132 encePairwiseOnDemand]: 138/142 looper letters, 2 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2020-10-09 14:43:29,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 328 flow [2020-10-09 14:43:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:43:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:43:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2020-10-09 14:43:29,815 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413145539906104 [2020-10-09 14:43:29,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2020-10-09 14:43:29,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2020-10-09 14:43:29,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:43:29,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2020-10-09 14:43:29,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:43:29,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:43:29,820 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:43:29,820 INFO L185 Difference]: Start difference. First operand has 131 places, 134 transitions, 330 flow. Second operand 3 states and 401 transitions. [2020-10-09 14:43:29,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 130 transitions, 328 flow [2020-10-09 14:43:29,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:43:29,828 INFO L241 Difference]: Finished difference. Result has 130 places, 130 transitions, 322 flow [2020-10-09 14:43:29,829 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2020-10-09 14:43:29,829 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2020-10-09 14:43:29,829 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 322 flow [2020-10-09 14:43:29,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:43:29,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:29,830 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:30,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 14:43:30,049 INFO L429 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -43774649, now seen corresponding path program 1 times [2020-10-09 14:43:30,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:30,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996500165] [2020-10-09 14:43:30,050 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 14:43:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:43:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996500165] [2020-10-09 14:43:30,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [100198759] [2020-10-09 14:43:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:43:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:30,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:43:30,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829705573] [2020-10-09 14:43:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:43:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:30,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:43:30,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:43:30,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:43:30,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2020-10-09 14:43:30,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224187768] [2020-10-09 14:43:30,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 14:43:30,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 14:43:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 14:43:30,952 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2020-10-09 14:43:30,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 322 flow. Second operand 8 states. [2020-10-09 14:43:30,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:30,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2020-10-09 14:43:30,953 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:43:31,114 INFO L129 PetriNetUnfolder]: 20/593 cut-off events. [2020-10-09 14:43:31,114 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2020-10-09 14:43:31,116 INFO L80 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 593 events. 20/593 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1858 event pairs, 0 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 709. Up to 28 conditions per place. [2020-10-09 14:43:31,119 INFO L132 encePairwiseOnDemand]: 135/142 looper letters, 18 selfloop transitions, 13 changer transitions 0/146 dead transitions. [2020-10-09 14:43:31,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 146 transitions, 444 flow [2020-10-09 14:43:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 14:43:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 14:43:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1164 transitions. [2020-10-09 14:43:31,123 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9107981220657277 [2020-10-09 14:43:31,123 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1164 transitions. [2020-10-09 14:43:31,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1164 transitions. [2020-10-09 14:43:31,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:43:31,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1164 transitions. [2020-10-09 14:43:31,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 14:43:31,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 14:43:31,130 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 14:43:31,130 INFO L185 Difference]: Start difference. First operand has 130 places, 130 transitions, 322 flow. Second operand 9 states and 1164 transitions. [2020-10-09 14:43:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 146 transitions, 444 flow [2020-10-09 14:43:31,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 146 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:43:31,136 INFO L241 Difference]: Finished difference. Result has 140 places, 140 transitions, 411 flow [2020-10-09 14:43:31,137 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2020-10-09 14:43:31,137 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2020-10-09 14:43:31,137 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 411 flow [2020-10-09 14:43:31,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 14:43:31,137 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:43:31,138 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] [2020-10-09 14:43:31,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:43:31,762 INFO L429 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:43:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:43:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1624861471, now seen corresponding path program 1 times [2020-10-09 14:43:31,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:43:31,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271097551] [2020-10-09 14:43:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 14:43:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:43:31,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 57 conjunts are in the unsatisfiable core [2020-10-09 14:43:31,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:43:32,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:43:32,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:43:32,377 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 22 treesize of output 18 [2020-10-09 14:43:32,377 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:43:32,424 INFO L625 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2020-10-09 14:43:32,429 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:43:32,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:59 [2020-10-09 14:43:32,605 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:43:32,606 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 45 treesize of output 48 [2020-10-09 14:43:32,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:43:32,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:43:32,707 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 14:43:32,763 INFO L625 ElimStorePlain]: treesize reduction 25, result has 71.9 percent of original size [2020-10-09 14:43:32,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 14:43:32,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:64 [2020-10-09 14:43:32,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:32,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:33,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:34,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:43:35,176 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:43:35,177 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 48 treesize of output 32 [2020-10-09 14:43:35,179 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:43:35,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:43:35,195 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 14:43:35,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:18 [2020-10-09 14:43:35,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:43:35,509 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:43:39,709 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 14:43:39,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:43:42,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) is different from false [2020-10-09 14:43:44,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296)))) is different from false [2020-10-09 14:43:46,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2020-10-09 14:43:46,640 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 168 treesize of output 152 [2020-10-09 14:43:46,644 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 14:43:46,696 INFO L625 ElimStorePlain]: treesize reduction 105, result has 23.9 percent of original size [2020-10-09 14:43:46,697 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 14:43:46,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:21 [2020-10-09 14:43:47,856 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:43:47,909 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:43:48,046 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 14:43:48,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271097551] [2020-10-09 14:43:48,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:43:48,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26, 23] imperfect sequences [] total 47 [2020-10-09 14:43:48,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69494227] [2020-10-09 14:43:48,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-10-09 14:43:48,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:43:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-10-09 14:43:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1751, Unknown=4, NotChecked=258, Total=2162 [2020-10-09 14:43:57,166 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 142 [2020-10-09 14:43:57,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 411 flow. Second operand 47 states. [2020-10-09 14:43:57,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:43:57,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 142 [2020-10-09 14:43:57,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:04,213 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-10-09 14:44:05,002 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-10-09 14:44:05,550 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-09 14:44:08,181 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296))) (let ((.cse0 (<= 5 .cse3)) (.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4)))) (.cse1 (< .cse3 5))) (and (= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35|) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 0) .cse0) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 1))) (< .cse2 4294967296) (or (and (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 1) .cse1) (and .cse0 (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 0))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x| 4294967296) (<= (div |c_t1Thread1of1ForFork0_push_#in~x| (- 4294967296)) (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x| (- 1)) 4) 4294967296)) (<= (div .cse2 (- 4294967296)) (div (+ (* .cse2 (- 1)) 4) 4294967296)) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res|) (<= 0 .cse2) .cse1 (= |c_~#arr~0.offset| 0) (<= (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (= c_~top~0 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x|)))) is different from false [2020-10-09 14:44:10,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 4) 4294967296)) (< .cse0 4294967296) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (= c_~top~0 0))) is different from false [2020-10-09 14:44:12,152 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (= |c_t1Thread1of1ForFork0_inc_top_#t~post30| 0) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296)))) (= |c_~#arr~0.offset| 0) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 4) 4294967296)) (<= 0 .cse0) (< .cse0 4294967296))) is different from false [2020-10-09 14:44:14,216 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 4) 4294967296)) (< .cse0 4294967296) (<= 0 .cse0) (= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) is different from false [2020-10-09 14:44:16,021 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-10-09 14:44:19,419 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-10-09 14:44:23,922 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:44:26,738 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (= c_~top~0 1) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (exists ((|ULTIMATE.start_main_~#id2~0.base| Int) (aux_div_v_arrayElimCell_1_38 Int) (aux_div_aux_mod_v_arrayElimCell_1_38_105 Int) (aux_mod_aux_mod_v_arrayElimCell_1_38_105 Int)) (let ((.cse1 (* 4294967296 aux_div_aux_mod_v_arrayElimCell_1_38_105))) (let ((.cse2 (+ .cse1 aux_mod_aux_mod_v_arrayElimCell_1_38_105))) (and (or (= 4 (+ .cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|) aux_mod_aux_mod_v_arrayElimCell_1_38_105)) (= |c_~#arr~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (<= aux_div_v_arrayElimCell_1_38 aux_div_aux_mod_v_arrayElimCell_1_38_105) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) 0) 1) (<= 0 aux_mod_aux_mod_v_arrayElimCell_1_38_105) (<= .cse2 4) (<= .cse2 (+ (* 4294967296 aux_div_v_arrayElimCell_1_38) 4)) (< 0 (+ .cse1 aux_mod_aux_mod_v_arrayElimCell_1_38_105 4294967292)))))) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:44:27,833 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-09 14:44:28,967 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-09 14:44:29,454 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-09 14:44:32,922 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-09 14:44:34,064 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-09 14:44:34,661 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-09 14:44:37,097 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse0 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* |c_t2Thread1of1ForFork1_get_top_#res| 4))) 4294967296) 4294967294)) (= .cse1 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse1 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (exists ((|aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56| Int) (|aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96_171| Int) (|aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| Int) (|aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141| Int)) (let ((.cse2 (* 4294967296 |aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96_171|))) (let ((.cse4 (* 4294967296 |aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56|)) (.cse3 (+ .cse2 (* 4294967296 |aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141|)))) (and (<= (+ |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 4294967292) .cse2) (<= .cse3 (+ |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 4294967296)) (<= .cse3 (+ .cse4 |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 4294967296)) (= (mod (+ (* (div (+ (* |aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96_171| 18446744069414584320) (* |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| (- 4294967295)) (- 18446744052234715140)) 4294967295) 4294967295) 4) 4294967296) |c_t2Thread1of1ForFork1_pop_#res|) (< |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| .cse3) (< (+ .cse4 |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96|) .cse3) (<= 0 |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96|) (< |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 4294967296) (< .cse2 (+ |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 8589934588)) (<= |aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56| |aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141|) (<= |aux_mod_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_141_96| 2147483647))))) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (= c_~top~0 0) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:44:39,998 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:44:45,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse0 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= 0 (+ |c_t2Thread1of1ForFork1_pop_#res| 2))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* |c_t2Thread1of1ForFork1_get_top_#res| 4))) 4294967296) 4294967294)) (= .cse1 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse1 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:44:50,747 INFO L129 PetriNetUnfolder]: 1626/5431 cut-off events. [2020-10-09 14:44:50,747 INFO L130 PetriNetUnfolder]: For 900/900 co-relation queries the response was YES. [2020-10-09 14:44:50,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10509 conditions, 5431 events. 1626/5431 cut-off events. For 900/900 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 43949 event pairs, 105 based on Foata normal form. 8/5162 useless extension candidates. Maximal degree in co-relation 4114. Up to 683 conditions per place. [2020-10-09 14:44:50,789 INFO L132 encePairwiseOnDemand]: 101/142 looper letters, 435 selfloop transitions, 190 changer transitions 18/700 dead transitions. [2020-10-09 14:44:50,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 700 transitions, 3117 flow [2020-10-09 14:44:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2020-10-09 14:44:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-09 14:44:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 8069 transitions. [2020-10-09 14:44:50,818 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.5028667580705471 [2020-10-09 14:44:50,819 INFO L72 ComplementDD]: Start complementDD. Operand 113 states and 8069 transitions. [2020-10-09 14:44:50,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 8069 transitions. [2020-10-09 14:44:50,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:50,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 113 states and 8069 transitions. [2020-10-09 14:44:50,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 114 states. [2020-10-09 14:44:50,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 114 states. [2020-10-09 14:44:50,860 INFO L81 ComplementDD]: Finished complementDD. Result 114 states. [2020-10-09 14:44:50,861 INFO L185 Difference]: Start difference. First operand has 140 places, 140 transitions, 411 flow. Second operand 113 states and 8069 transitions. [2020-10-09 14:44:50,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 700 transitions, 3117 flow [2020-10-09 14:44:50,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 700 transitions, 3105 flow, removed 6 selfloop flow, removed 0 redundant places. [2020-10-09 14:44:50,879 INFO L241 Difference]: Finished difference. Result has 281 places, 332 transitions, 1717 flow [2020-10-09 14:44:50,879 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=1717, PETRI_PLACES=281, PETRI_TRANSITIONS=332} [2020-10-09 14:44:50,880 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 155 predicate places. [2020-10-09 14:44:50,880 INFO L481 AbstractCegarLoop]: Abstraction has has 281 places, 332 transitions, 1717 flow [2020-10-09 14:44:50,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-10-09 14:44:50,880 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:50,880 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] [2020-10-09 14:44:51,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 14:44:51,093 INFO L429 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1477476145, now seen corresponding path program 2 times [2020-10-09 14:44:51,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:51,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079687318] [2020-10-09 14:44:51,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:51,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 14:44:51,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:44:51,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2020-10-09 14:44:51,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:51,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:44:51,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:51,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:51,655 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 22 treesize of output 18 [2020-10-09 14:44:51,656 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:51,707 INFO L625 ElimStorePlain]: treesize reduction 13, result has 81.4 percent of original size [2020-10-09 14:44:51,710 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:44:51,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:56 [2020-10-09 14:44:52,214 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 41 treesize of output 21 [2020-10-09 14:44:52,214 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:52,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:52,229 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 14:44:52,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2020-10-09 14:44:52,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:52,388 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:53,660 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 14:44:53,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:54,850 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 54 treesize of output 46 [2020-10-09 14:44:54,853 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-09 14:44:54,879 INFO L625 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2020-10-09 14:44:54,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 14:44:54,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2020-10-09 14:44:56,022 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:56,065 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:56,181 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 14:44:56,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079687318] [2020-10-09 14:44:56,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:56,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [] total 44 [2020-10-09 14:44:56,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175143473] [2020-10-09 14:44:56,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-10-09 14:44:56,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-10-09 14:44:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2020-10-09 14:49:57,954 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2020-10-09 14:49:57,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 332 transitions, 1717 flow. Second operand 44 states. [2020-10-09 14:49:57,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:49:57,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2020-10-09 14:49:57,957 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:49:58,885 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:49:59,982 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:50:00,811 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-10-09 14:50:02,042 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-09 14:50:03,351 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-10-09 14:50:04,523 WARN L193 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-10-09 14:50:05,897 WARN L193 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-10-09 14:50:07,079 WARN L193 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-10-09 14:50:08,748 WARN L193 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-10-09 14:50:09,633 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-10-09 14:50:10,039 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-09 14:50:10,607 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-09 14:50:11,225 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:50:11,959 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:50:12,725 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:50:13,959 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:50:14,460 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-09 14:50:15,087 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:50:15,915 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:50:16,904 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:50:17,536 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:50:18,169 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:50:18,904 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:50:19,460 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:50:20,256 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:50:20,926 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:50:21,747 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:50:22,281 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:50:23,299 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-09 14:50:24,221 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-09 14:50:24,811 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:50:27,771 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-09 14:50:33,579 WARN L193 SmtUtils]: Spent 4.67 s on a formula simplification that was a NOOP. DAG size: 106 [2020-10-09 14:50:33,878 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-09 14:50:35,334 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-09 14:50:36,349 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-09 14:50:39,133 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-09 14:50:39,556 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:50:40,932 WARN L193 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2020-10-09 14:50:43,840 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 117 DAG size of output: 108 [2020-10-09 14:50:44,197 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:50:44,643 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:50:46,562 WARN L193 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-10-09 14:50:48,296 WARN L193 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-10-09 14:50:48,622 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:50:50,774 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2020-10-09 14:50:51,746 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:50:53,636 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2020-10-09 14:50:53,949 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:50:55,834 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2020-10-09 14:50:58,885 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:50:59,169 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:50:59,545 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:50:59,910 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:51:02,121 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2020-10-09 14:51:02,493 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:51:02,810 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:51:06,073 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-10-09 14:51:06,468 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:51:07,121 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:51:07,489 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:07,822 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:08,201 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:51:08,626 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:51:09,745 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:51:11,048 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-09 14:51:11,597 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:51:12,420 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:51:13,236 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:51:14,432 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:51:15,404 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:51:17,055 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:51:17,528 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:51:18,246 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:19,040 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:51:19,877 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:51:20,452 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:21,209 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-09 14:51:21,889 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:51:22,763 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-09 14:51:23,197 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:51:23,984 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-09 14:51:24,527 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-09 14:51:25,300 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-09 14:51:25,764 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:51:26,376 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:51:26,666 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:51:27,039 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:51:27,522 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:28,378 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:51:28,865 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:51:29,614 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:51:30,352 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:30,931 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-10-09 14:51:31,455 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:32,123 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:32,478 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:32,980 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:35,818 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:51:36,556 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:51:37,818 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:51:38,547 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:51:39,055 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:51:39,363 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:51:39,982 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:51:40,335 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-09 14:51:40,704 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:51:41,252 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:51:41,610 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:51:42,143 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:51:42,499 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:51:42,935 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:51:43,350 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:51:43,809 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-09 14:51:43,966 INFO L129 PetriNetUnfolder]: 792/5301 cut-off events. [2020-10-09 14:51:43,966 INFO L130 PetriNetUnfolder]: For 31558/32207 co-relation queries the response was YES. [2020-10-09 14:51:44,004 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17646 conditions, 5301 events. 792/5301 cut-off events. For 31558/32207 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 45578 event pairs, 130 based on Foata normal form. 41/5040 useless extension candidates. Maximal degree in co-relation 17363. Up to 729 conditions per place. [2020-10-09 14:51:44,030 INFO L132 encePairwiseOnDemand]: 104/142 looper letters, 203 selfloop transitions, 375 changer transitions 5/689 dead transitions. [2020-10-09 14:51:44,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 689 transitions, 5581 flow [2020-10-09 14:51:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2020-10-09 14:51:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-09 14:51:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 11557 transitions. [2020-10-09 14:51:44,051 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.6073680891318057 [2020-10-09 14:51:44,051 INFO L72 ComplementDD]: Start complementDD. Operand 134 states and 11557 transitions. [2020-10-09 14:51:44,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 11557 transitions. [2020-10-09 14:51:44,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:51:44,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 134 states and 11557 transitions. [2020-10-09 14:51:44,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 135 states. [2020-10-09 14:51:44,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 135 states. [2020-10-09 14:51:44,102 INFO L81 ComplementDD]: Finished complementDD. Result 135 states. [2020-10-09 14:51:44,102 INFO L185 Difference]: Start difference. First operand has 281 places, 332 transitions, 1717 flow. Second operand 134 states and 11557 transitions. [2020-10-09 14:51:44,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 689 transitions, 5581 flow [2020-10-09 14:51:44,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 689 transitions, 5497 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-09 14:51:44,167 INFO L241 Difference]: Finished difference. Result has 428 places, 562 transitions, 4076 flow [2020-10-09 14:51:44,169 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=4076, PETRI_PLACES=428, PETRI_TRANSITIONS=562} [2020-10-09 14:51:44,169 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 302 predicate places. [2020-10-09 14:51:44,169 INFO L481 AbstractCegarLoop]: Abstraction has has 428 places, 562 transitions, 4076 flow [2020-10-09 14:51:44,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-10-09 14:51:44,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:51:44,170 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:51:44,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 14:51:44,380 INFO L429 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:51:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:51:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1995114914, now seen corresponding path program 1 times [2020-10-09 14:51:44,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:51:44,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621844435] [2020-10-09 14:51:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-09 14:51:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:51:44,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:51:44,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:51:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:44,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:51:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:44,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621844435] [2020-10-09 14:51:44,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543725967] [2020-10-09 14:51:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:51:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:51:45,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:51:45,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:51:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:45,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:51:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:45,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812704577] [2020-10-09 14:51:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:51:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:51:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:51:45,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:51:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:45,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:51:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:51:45,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:51:45,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 14 [2020-10-09 14:51:45,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771823368] [2020-10-09 14:51:45,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 14:51:45,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:51:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 14:51:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-09 14:51:47,946 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2020-10-09 14:51:47,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 562 transitions, 4076 flow. Second operand 14 states. [2020-10-09 14:51:47,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:51:47,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2020-10-09 14:51:47,948 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:51:50,115 INFO L129 PetriNetUnfolder]: 770/5959 cut-off events. [2020-10-09 14:51:50,115 INFO L130 PetriNetUnfolder]: For 32418/32617 co-relation queries the response was YES. [2020-10-09 14:51:50,149 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19260 conditions, 5959 events. 770/5959 cut-off events. For 32418/32617 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 52969 event pairs, 161 based on Foata normal form. 21/5628 useless extension candidates. Maximal degree in co-relation 18936. Up to 789 conditions per place. [2020-10-09 14:51:50,173 INFO L132 encePairwiseOnDemand]: 132/142 looper letters, 69 selfloop transitions, 153 changer transitions 0/633 dead transitions. [2020-10-09 14:51:50,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 633 transitions, 5306 flow [2020-10-09 14:51:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-09 14:51:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-09 14:51:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2362 transitions. [2020-10-09 14:51:50,180 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8754633061527057 [2020-10-09 14:51:50,180 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2362 transitions. [2020-10-09 14:51:50,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2362 transitions. [2020-10-09 14:51:50,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:51:50,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2362 transitions. [2020-10-09 14:51:50,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-09 14:51:50,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-09 14:51:50,187 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-09 14:51:50,187 INFO L185 Difference]: Start difference. First operand has 428 places, 562 transitions, 4076 flow. Second operand 19 states and 2362 transitions. [2020-10-09 14:51:50,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 633 transitions, 5306 flow [2020-10-09 14:51:50,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 633 transitions, 4892 flow, removed 115 selfloop flow, removed 15 redundant places. [2020-10-09 14:51:50,280 INFO L241 Difference]: Finished difference. Result has 436 places, 592 transitions, 4396 flow [2020-10-09 14:51:50,281 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3641, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4396, PETRI_PLACES=436, PETRI_TRANSITIONS=592} [2020-10-09 14:51:50,281 INFO L341 CegarLoopForPetriNet]: 126 programPoint places, 310 predicate places. [2020-10-09 14:51:50,282 INFO L481 AbstractCegarLoop]: Abstraction has has 436 places, 592 transitions, 4396 flow [2020-10-09 14:51:50,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 14:51:50,282 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:51:50,282 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:51:50,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2020-10-09 14:51:50,891 INFO L429 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:51:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:51:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1037985767, now seen corresponding path program 1 times [2020-10-09 14:51:50,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:51:50,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759220050] [2020-10-09 14:51:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-09 14:51:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:51:51,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 77 conjunts are in the unsatisfiable core [2020-10-09 14:51:51,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:51:51,190 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-09 14:51:51,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:51:51,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:51:51,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:51:51,849 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-10-09 14:51:52,218 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-09 14:51:52,450 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-09 14:51:52,665 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-09 14:51:52,694 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 22 treesize of output 18 [2020-10-09 14:51:52,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:51:52,825 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-10-09 14:51:52,827 INFO L625 ElimStorePlain]: treesize reduction 13, result has 81.4 percent of original size [2020-10-09 14:51:52,829 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:51:52,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:56 [2020-10-09 14:51:53,556 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-10-09 14:51:54,027 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-09 14:51:54,359 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-09 14:51:54,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-09 14:51:54,397 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 49 treesize of output 36 [2020-10-09 14:51:54,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:51:54,536 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:51:54,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:51:54,542 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:51:54,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:40 [2020-10-09 14:51:55,282 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-10-09 14:51:57,395 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 41 treesize of output 21 [2020-10-09 14:51:57,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:51:57,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:51:57,454 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 14:51:57,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2020-10-09 14:51:57,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:51:57,868 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:52:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:52:00,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:52:09,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35_59| Int) (t1Thread1of1ForFork0_push_~x Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35_59| |c_t1Thread1of1ForFork0_get_top_#res|) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35_59| 4) c_t1Thread1of1ForFork0_push_~stack.offset) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2020-10-09 14:53:04,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_t1Thread1of1ForFork0_push_~stack.offset_51 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_59| Int) (t1Thread1of1ForFork0_push_~x Int)) (or (< v_t1Thread1of1ForFork0_push_~stack.offset_51 |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_51 (* |v_t1Thread1of1ForFork0_push_#t~ret35_59| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35_59| c_~top~0))) is different from false [2020-10-09 14:53:06,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_t1Thread1of1ForFork0_push_~stack.offset_51 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_59| Int) (t1Thread1of1ForFork0_push_~x Int)) (or (< v_t1Thread1of1ForFork0_push_~stack.offset_51 |c_~#arr~0.offset|) (not (= (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_51 (* |v_t1Thread1of1ForFork0_push_#t~ret35_59| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35_59| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post30| 1)))) is different from false [2020-10-09 14:53:08,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_t1Thread1of1ForFork0_push_~stack.offset_51 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_59| Int) (t1Thread1of1ForFork0_push_~x Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35_59| (+ c_~top~0 1)) (< v_t1Thread1of1ForFork0_push_~stack.offset_51 |c_~#arr~0.offset|) (not (= (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_51 (* |v_t1Thread1of1ForFork0_push_#t~ret35_59| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:53:09,004 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:53:09,030 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,030 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:09,067 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,068 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 34 treesize of output 38 [2020-10-09 14:53:09,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:09,080 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:09,083 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_9], 1=[v_arrayElimCell_10]} [2020-10-09 14:53:09,741 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,741 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:09,778 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,778 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 34 treesize of output 38 [2020-10-09 14:53:09,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:09,793 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:09,795 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_11], 1=[v_arrayElimCell_12]} [2020-10-09 14:53:09,831 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,831 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:09,866 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,867 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 34 treesize of output 38 [2020-10-09 14:53:09,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:09,873 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:09,875 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_13], 1=[v_arrayElimCell_14]} [2020-10-09 14:53:09,917 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,918 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:09,955 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:09,956 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 34 treesize of output 38 [2020-10-09 14:53:09,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:09,964 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:09,966 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_15], 1=[v_arrayElimCell_16]} [2020-10-09 14:53:10,001 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,001 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:10,036 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,037 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 34 treesize of output 38 [2020-10-09 14:53:10,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:10,043 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:10,045 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17], 1=[v_arrayElimCell_18]} [2020-10-09 14:53:10,082 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,082 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:10,118 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,119 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 34 treesize of output 38 [2020-10-09 14:53:10,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:10,126 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:10,128 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_19], 1=[v_arrayElimCell_20]} [2020-10-09 14:53:10,778 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,779 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:10,813 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:10,814 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 34 treesize of output 38 [2020-10-09 14:53:10,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:10,820 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:10,822 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_21], 1=[v_arrayElimCell_22]} [2020-10-09 14:53:11,389 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,389 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:11,424 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,425 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 34 treesize of output 38 [2020-10-09 14:53:11,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:11,432 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:11,434 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_23], 1=[v_arrayElimCell_24]} [2020-10-09 14:53:11,479 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,480 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:11,514 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,515 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 34 treesize of output 38 [2020-10-09 14:53:11,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:11,521 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:11,523 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_25], 1=[v_arrayElimCell_26]} [2020-10-09 14:53:11,568 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:11,604 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:11,605 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 34 treesize of output 38 [2020-10-09 14:53:11,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:11,612 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:11,614 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_27], 1=[v_arrayElimCell_28]} [2020-10-09 14:53:12,246 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:12,247 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:12,280 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:12,281 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 34 treesize of output 38 [2020-10-09 14:53:12,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:12,288 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:12,290 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_29], 1=[v_arrayElimCell_30]} [2020-10-09 14:53:12,885 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:12,886 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:12,927 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:12,927 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 34 treesize of output 38 [2020-10-09 14:53:12,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:12,933 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:12,935 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_31], 1=[v_arrayElimCell_32]} [2020-10-09 14:53:12,969 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:12,970 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2020-10-09 14:53:13,004 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:13,005 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 34 treesize of output 38 [2020-10-09 14:53:13,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:13,013 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:13,015 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_33], 1=[v_arrayElimCell_34]} [2020-10-09 14:53:13,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-09 14:53:13,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:13,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:53:13,058 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 32 treesize of output 30 [2020-10-09 14:53:13,067 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:13,076 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:13,078 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:13,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:13,090 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:13,104 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 30 treesize of output 28 [2020-10-09 14:53:13,112 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:13,121 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:53:13,123 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:13,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:13,135 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:13,250 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2020-10-09 14:53:13,252 INFO L625 ElimStorePlain]: treesize reduction 29, result has 34.1 percent of original size [2020-10-09 14:53:13,256 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:13,257 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:92, output treesize:6 [2020-10-09 14:53:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2020-10-09 14:53:14,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759220050] [2020-10-09 14:53:14,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [89857672] [2020-10-09 14:53:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:53:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:53:14,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2020-10-09 14:53:14,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:53:14,906 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 14:53:14,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:14,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:14,934 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:14,934 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-09 14:53:15,921 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:15,922 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 14:53:15,923 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:16,035 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2020-10-09 14:53:16,037 INFO L625 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2020-10-09 14:53:16,038 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 14:53:16,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2020-10-09 14:53:16,696 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-09 14:53:16,697 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:16,698 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-10-09 14:53:16,699 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:16,879 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-10-09 14:53:16,882 INFO L625 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-10-09 14:53:16,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 14:53:16,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:41 [2020-10-09 14:53:17,465 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:17,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-10-09 14:53:17,466 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:17,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:17,533 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:17,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2020-10-09 14:53:17,994 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 14:53:17,995 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:18,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:18,055 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 14:53:18,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-10-09 14:53:19,322 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:53:20,572 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:53:20,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-09 14:53:20,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:53:21,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:53:23,660 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2020-10-09 14:53:24,482 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:53:25,546 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:53:26,539 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:53:27,517 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:53:27,558 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 26 treesize of output 28 [2020-10-09 14:53:27,558 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:27,731 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:53:27,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:27,735 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 14:53:27,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:66 [2020-10-09 14:53:29,048 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:53:29,188 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:29,188 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 44 treesize of output 80 [2020-10-09 14:53:29,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:29,618 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-09 14:53:29,621 INFO L625 ElimStorePlain]: treesize reduction 36, result has 74.3 percent of original size [2020-10-09 14:53:29,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 14:53:29,634 INFO L545 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-10-09 14:53:29,635 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:113, output treesize:109 [2020-10-09 14:53:29,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 14:53:30,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 14:53:30,605 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:53:30,784 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-09 14:53:31,090 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-10-09 14:53:32,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 14:53:32,430 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:53:32,626 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-09 14:53:32,988 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-10-09 14:53:34,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 14:53:34,659 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:53:34,836 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-09 14:53:35,134 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-10-09 14:53:36,254 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2020-10-09 14:53:38,150 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:53:38,980 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:53:39,899 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:53:40,842 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:53:40,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-09 14:53:40,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2020-10-09 14:53:40,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:41,069 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-09 14:53:41,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:41,075 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 14:53:41,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:87, output treesize:66 [2020-10-09 14:53:45,431 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-10-09 14:53:48,212 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-10-09 14:53:49,134 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 55 treesize of output 27 [2020-10-09 14:53:49,150 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:53:49,252 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-09 14:53:49,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:53:49,258 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:53:49,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:18 [2020-10-09 14:53:49,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:53:49,362 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:53:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:53:51,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:54:24,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((t1Thread1of1ForFork0_push_~x Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_65| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35_65| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_push_#t~ret35_65| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:54:50,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((t1Thread1of1ForFork0_push_~x Int) (v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_65| Int)) (or (< v_t1Thread1of1ForFork0_push_~stack.offset_55 |c_~#arr~0.offset|) (not (= (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_65| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35_65| c_~top~0))) is different from false [2020-10-09 14:54:53,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((t1Thread1of1ForFork0_push_~x Int) (v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_65| Int)) (or (< v_t1Thread1of1ForFork0_push_~stack.offset_55 |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35_65| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post30| 1)) (not (= 4294967294 (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_65| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296))))) is different from false [2020-10-09 14:54:55,033 WARN L838 $PredicateComparison]: unable to prove that (forall ((t1Thread1of1ForFork0_push_~x Int) (v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_65| Int)) (or (< v_t1Thread1of1ForFork0_push_~stack.offset_55 |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35_65| (+ c_~top~0 1)) (not (= (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_65| 4)) t1Thread1of1ForFork0_push_~x) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:54:55,046 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:56:49,139 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 Received shutdown request... [2020-10-09 14:57:44,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:57:44,056 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 14:57:44,062 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 14:57:44,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:57:44 BasicIcfg [2020-10-09 14:57:44,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:57:44,064 INFO L168 Benchmark]: Toolchain (without parser) took 859092.62 ms. Allocated memory was 250.6 MB in the beginning and 556.8 MB in the end (delta: 306.2 MB). Free memory was 205.3 MB in the beginning and 143.4 MB in the end (delta: 62.0 MB). Peak memory consumption was 368.2 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,065 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:57:44,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 984.36 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 205.3 MB in the beginning and 239.7 MB in the end (delta: -34.4 MB). Peak memory consumption was 36.9 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.13 ms. Allocated memory is still 312.0 MB. Free memory was 239.7 MB in the beginning and 237.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,066 INFO L168 Benchmark]: Boogie Preprocessor took 67.19 ms. Allocated memory is still 312.0 MB. Free memory was 237.2 MB in the beginning and 234.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,066 INFO L168 Benchmark]: RCFGBuilder took 606.93 ms. Allocated memory is still 312.0 MB. Free memory was 234.7 MB in the beginning and 200.3 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,071 INFO L168 Benchmark]: TraceAbstraction took 857352.85 ms. Allocated memory was 312.0 MB in the beginning and 556.8 MB in the end (delta: 244.8 MB). Free memory was 200.3 MB in the beginning and 143.4 MB in the end (delta: 56.9 MB). Peak memory consumption was 301.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:57:44,073 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.20 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 984.36 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 205.3 MB in the beginning and 239.7 MB in the end (delta: -34.4 MB). Peak memory consumption was 36.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.13 ms. Allocated memory is still 312.0 MB. Free memory was 239.7 MB in the beginning and 237.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 67.19 ms. Allocated memory is still 312.0 MB. Free memory was 237.2 MB in the beginning and 234.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 606.93 ms. Allocated memory is still 312.0 MB. Free memory was 234.7 MB in the beginning and 200.3 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 857352.85 ms. Allocated memory was 312.0 MB in the beginning and 556.8 MB in the end (delta: 244.8 MB). Free memory was 200.3 MB in the beginning and 143.4 MB in the end (delta: 56.9 MB). Peak memory consumption was 301.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 922). Cancelled while CegarLoopForPetriNet was analyzing trace of length 157 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 98 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 922). Cancelled while CegarLoopForPetriNet was analyzing trace of length 157 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 98 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 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: 857.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 477.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 202 SDtfs, 3021 SDslu, 15415 SDs, 0 SdLazy, 19483 SolverSat, 258 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 69.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2550 GetRequests, 2178 SyntacticMatches, 16 SemanticMatches, 356 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15554 ImplicationChecksByTransitivity, 138.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4396occurred in iteration=8, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 1147 NumberOfCodeBlocks, 1147 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2270 ConstructedInterpolants, 45 QuantifiedInterpolants, 1241290 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2629 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 162/528 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