/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_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:44:10,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:44:10,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:44:10,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:44:10,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:44:10,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:44:10,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:44:10,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:44:10,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:44:10,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:44:10,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:44:10,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:44:10,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:44:10,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:44:10,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:44:10,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:44:10,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:44:10,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:44:10,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:44:10,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:44:10,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:44:10,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:44:10,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:44:10,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:44:10,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:44:10,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:44:10,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:44:10,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:44:10,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:44:10,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:44:10,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:44:10,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:44:10,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:44:10,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:44:10,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:44:10,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:44:10,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:44:10,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:44:10,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:44:10,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:44:10,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:44:10,283 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:44:10,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:44:10,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:44:10,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:44:10,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:44:10,336 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:44:10,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:44:10,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:44:10,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:44:10,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:44:10,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:44:10,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:44:10,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:44:10,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:44:10,340 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:44:10,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:44:10,341 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:44:10,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:44:10,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:44:10,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:44:10,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:44:10,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:44:10,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:44:10,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:44:10,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:44:10,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:44:10,343 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:44:10,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:44:10,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:44:10,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:44:10,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:44:10,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:44:10,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:44:10,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:44:10,711 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:44:10,711 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:44:10,712 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2020-10-09 14:44:10,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7656c11a4/583e2a48c56644dcb80fe0a7828725c4/FLAG0c47b5c69 [2020-10-09 14:44:11,471 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:44:11,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2020-10-09 14:44:11,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7656c11a4/583e2a48c56644dcb80fe0a7828725c4/FLAG0c47b5c69 [2020-10-09 14:44:11,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7656c11a4/583e2a48c56644dcb80fe0a7828725c4 [2020-10-09 14:44:11,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:44:11,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:44:11,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:44:11,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:44:11,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:44:11,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:44:11" (1/1) ... [2020-10-09 14:44:11,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6704dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:11, skipping insertion in model container [2020-10-09 14:44:11,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:44:11" (1/1) ... [2020-10-09 14:44:11,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:44:11,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:44:12,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:44:12,311 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:44:12,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:44:12,539 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:44:12,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12 WrapperNode [2020-10-09 14:44:12,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:44:12,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:44:12,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:44:12,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:44:12,552 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:44:12" (1/1) ... [2020-10-09 14:44:12,574 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:44:12" (1/1) ... [2020-10-09 14:44:12,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:44:12,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:44:12,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:44:12,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:44:12,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (1/1) ... [2020-10-09 14:44:12,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:44:12,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:44:12,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:44:12,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:44:12,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (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:44:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:44:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:44:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:44:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:44:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:44:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:44:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 14:44:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:44:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-09 14:44:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 14:44:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:44:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:44:12,720 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:44:13,249 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:44:13,250 INFO L298 CfgBuilder]: Removed 26 assume(true) statements. [2020-10-09 14:44:13,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:44:13 BoogieIcfgContainer [2020-10-09 14:44:13,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:44:13,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:44:13,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:44:13,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:44:13,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:44:11" (1/3) ... [2020-10-09 14:44:13,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ce433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:44:13, skipping insertion in model container [2020-10-09 14:44:13,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:12" (2/3) ... [2020-10-09 14:44:13,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ce433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:44:13, skipping insertion in model container [2020-10-09 14:44:13,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:44:13" (3/3) ... [2020-10-09 14:44:13,261 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2020-10-09 14:44:13,274 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:44:13,283 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 14:44:13,284 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:44:13,321 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,322 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,322 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,322 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,323 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,323 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,323 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,323 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,324 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,324 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,324 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,324 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,325 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,325 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,325 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,325 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,326 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,326 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:44:13,326 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:44:13,326 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:44:13,327 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:44:13,327 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:44:13,327 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:44:13,328 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,328 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,328 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,328 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,329 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,329 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,329 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,329 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,329 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,330 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,330 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,330 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,330 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,331 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,331 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,331 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,331 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,332 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,332 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,332 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,332 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,333 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,333 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,333 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,333 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,334 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,334 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,334 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,334 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,335 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,335 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,335 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,335 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,336 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,336 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,336 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,337 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,337 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,337 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,337 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,338 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,338 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,338 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,338 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,339 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,340 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,340 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,341 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,341 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,341 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,342 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,342 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,342 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,342 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,343 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,343 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,343 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,344 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,344 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,344 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,345 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,345 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,345 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,345 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,345 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,346 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,346 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,346 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,347 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,347 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,347 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,347 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,348 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,348 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,348 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,348 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,349 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,349 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,349 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,349 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,350 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,350 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,350 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,350 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,351 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,351 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,351 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,351 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,352 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,352 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,352 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,353 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,353 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,353 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,353 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,353 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,354 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,354 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,354 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,354 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,355 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,355 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,355 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,355 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,360 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,360 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,361 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,361 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,361 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,361 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,362 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,362 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,362 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,362 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,363 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,363 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:44:13,363 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,363 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,364 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,364 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,364 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,364 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,364 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,365 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:44:13,365 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,365 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,365 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,372 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,372 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,373 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,373 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,373 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,374 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,374 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,374 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,374 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,375 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,375 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,375 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,375 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,376 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,376 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,376 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,376 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,377 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,377 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:13,405 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 14:44:13,425 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:44:13,425 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:44:13,426 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:44:13,426 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:44:13,426 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:44:13,426 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:44:13,426 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:44:13,427 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:44:13,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 140 places, 145 transitions, 312 flow [2020-10-09 14:44:13,516 INFO L129 PetriNetUnfolder]: 11/145 cut-off events. [2020-10-09 14:44:13,517 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 14:44:13,527 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 145 events. 11/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 383 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 113. Up to 3 conditions per place. [2020-10-09 14:44:13,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 145 transitions, 312 flow [2020-10-09 14:44:13,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 133 transitions, 278 flow [2020-10-09 14:44:13,593 INFO L129 PetriNetUnfolder]: 7/118 cut-off events. [2020-10-09 14:44:13,593 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 14:44:13,594 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:13,595 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:44:13,595 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:44:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash -520625803, now seen corresponding path program 1 times [2020-10-09 14:44:13,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:13,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488333794] [2020-10-09 14:44:13,626 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:44:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:13,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:44:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:13,857 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:13,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:13,884 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:13,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488333794] [2020-10-09 14:44:13,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:13,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:44:13,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535418349] [2020-10-09 14:44:13,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:13,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:13,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:14,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 145 [2020-10-09 14:44:14,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 278 flow. Second operand 4 states. [2020-10-09 14:44:14,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:14,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 145 [2020-10-09 14:44:14,016 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:14,104 INFO L129 PetriNetUnfolder]: 14/254 cut-off events. [2020-10-09 14:44:14,105 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2020-10-09 14:44:14,110 INFO L80 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 254 events. 14/254 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 678 event pairs, 0 based on Foata normal form. 23/259 useless extension candidates. Maximal degree in co-relation 240. Up to 14 conditions per place. [2020-10-09 14:44:14,113 INFO L132 encePairwiseOnDemand]: 136/145 looper letters, 3 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2020-10-09 14:44:14,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 284 flow [2020-10-09 14:44:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:44:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:44:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2020-10-09 14:44:14,133 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9747126436781609 [2020-10-09 14:44:14,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2020-10-09 14:44:14,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2020-10-09 14:44:14,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:14,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2020-10-09 14:44:14,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:44:14,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:44:14,153 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:44:14,160 INFO L185 Difference]: Start difference. First operand has 129 places, 133 transitions, 278 flow. Second operand 3 states and 424 transitions. [2020-10-09 14:44:14,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 130 transitions, 284 flow [2020-10-09 14:44:14,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 14:44:14,172 INFO L241 Difference]: Finished difference. Result has 128 places, 130 transitions, 279 flow [2020-10-09 14:44:14,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2020-10-09 14:44:14,177 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, -1 predicate places. [2020-10-09 14:44:14,177 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 279 flow [2020-10-09 14:44:14,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:14,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:14,177 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] [2020-10-09 14:44:14,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:44:14,396 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:44:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1537873692, now seen corresponding path program 1 times [2020-10-09 14:44:14,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:14,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483301380] [2020-10-09 14:44:14,400 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:44:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:14,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 14:44:14,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:14,490 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:14,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:14,504 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:14,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483301380] [2020-10-09 14:44:14,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:14,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:44:14,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278885187] [2020-10-09 14:44:14,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:14,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:14,545 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 145 [2020-10-09 14:44:14,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 279 flow. Second operand 4 states. [2020-10-09 14:44:14,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:14,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 145 [2020-10-09 14:44:14,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:14,597 INFO L129 PetriNetUnfolder]: 14/273 cut-off events. [2020-10-09 14:44:14,598 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-09 14:44:14,600 INFO L80 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 273 events. 14/273 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 751 event pairs, 2 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 252. Up to 11 conditions per place. [2020-10-09 14:44:14,602 INFO L132 encePairwiseOnDemand]: 141/145 looper letters, 4 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2020-10-09 14:44:14,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 133 transitions, 298 flow [2020-10-09 14:44:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 14:44:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-09 14:44:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2020-10-09 14:44:14,606 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551724137931035 [2020-10-09 14:44:14,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2020-10-09 14:44:14,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2020-10-09 14:44:14,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:14,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2020-10-09 14:44:14,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-09 14:44:14,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-09 14:44:14,611 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-09 14:44:14,611 INFO L185 Difference]: Start difference. First operand has 128 places, 130 transitions, 279 flow. Second operand 4 states and 554 transitions. [2020-10-09 14:44:14,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 133 transitions, 298 flow [2020-10-09 14:44:14,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 133 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:14,616 INFO L241 Difference]: Finished difference. Result has 133 places, 132 transitions, 302 flow [2020-10-09 14:44:14,617 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2020-10-09 14:44:14,617 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 4 predicate places. [2020-10-09 14:44:14,618 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 302 flow [2020-10-09 14:44:14,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:14,618 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:14,618 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] [2020-10-09 14:44:14,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:44:14,831 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:44:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29890135, now seen corresponding path program 1 times [2020-10-09 14:44:14,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:14,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445314496] [2020-10-09 14:44:14,835 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:44:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:14,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 14:44:14,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:14,943 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:14,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:14,966 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:14,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445314496] [2020-10-09 14:44:14,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:14,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-09 14:44:14,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424383626] [2020-10-09 14:44:14,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:14,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:15,039 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 145 [2020-10-09 14:44:15,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 302 flow. Second operand 4 states. [2020-10-09 14:44:15,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:15,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 145 [2020-10-09 14:44:15,041 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:15,156 INFO L129 PetriNetUnfolder]: 15/339 cut-off events. [2020-10-09 14:44:15,157 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2020-10-09 14:44:15,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 339 events. 15/339 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1154 event pairs, 2 based on Foata normal form. 3/322 useless extension candidates. Maximal degree in co-relation 343. Up to 17 conditions per place. [2020-10-09 14:44:15,161 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 7 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2020-10-09 14:44:15,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 330 flow [2020-10-09 14:44:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 14:44:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-09 14:44:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2020-10-09 14:44:15,164 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9310344827586207 [2020-10-09 14:44:15,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2020-10-09 14:44:15,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2020-10-09 14:44:15,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:15,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2020-10-09 14:44:15,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-09 14:44:15,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-09 14:44:15,168 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-09 14:44:15,168 INFO L185 Difference]: Start difference. First operand has 133 places, 132 transitions, 302 flow. Second operand 4 states and 540 transitions. [2020-10-09 14:44:15,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 330 flow [2020-10-09 14:44:15,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-09 14:44:15,174 INFO L241 Difference]: Finished difference. Result has 138 places, 135 transitions, 330 flow [2020-10-09 14:44:15,174 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2020-10-09 14:44:15,175 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 9 predicate places. [2020-10-09 14:44:15,175 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 330 flow [2020-10-09 14:44:15,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:15,175 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:15,176 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] [2020-10-09 14:44:15,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 14:44:15,390 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:44:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1984788975, now seen corresponding path program 1 times [2020-10-09 14:44:15,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:15,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920399007] [2020-10-09 14:44:15,393 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:44:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:15,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:15,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:15,545 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:44:15,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:15,604 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:44:15,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920399007] [2020-10-09 14:44:15,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1250534835] [2020-10-09 14:44:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:44:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:15,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:15,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:15,874 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:44:15,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:15,923 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:44:15,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147148485] [2020-10-09 14:44:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:44:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:16,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:16,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:16,095 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:44:16,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:16,133 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:44:16,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:44:16,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2020-10-09 14:44:16,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656640459] [2020-10-09 14:44:16,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 14:44:16,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:16,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 14:44:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 14:44:16,541 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 145 [2020-10-09 14:44:16,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 330 flow. Second operand 8 states. [2020-10-09 14:44:16,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:16,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 145 [2020-10-09 14:44:16,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:16,789 INFO L129 PetriNetUnfolder]: 55/781 cut-off events. [2020-10-09 14:44:16,789 INFO L130 PetriNetUnfolder]: For 69/90 co-relation queries the response was YES. [2020-10-09 14:44:16,798 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 781 events. 55/781 cut-off events. For 69/90 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3714 event pairs, 0 based on Foata normal form. 5/738 useless extension candidates. Maximal degree in co-relation 925. Up to 45 conditions per place. [2020-10-09 14:44:16,802 INFO L132 encePairwiseOnDemand]: 139/145 looper letters, 12 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2020-10-09 14:44:16,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 152 transitions, 432 flow [2020-10-09 14:44:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 14:44:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-09 14:44:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1348 transitions. [2020-10-09 14:44:16,808 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9296551724137931 [2020-10-09 14:44:16,808 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1348 transitions. [2020-10-09 14:44:16,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1348 transitions. [2020-10-09 14:44:16,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:16,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1348 transitions. [2020-10-09 14:44:16,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-09 14:44:16,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-09 14:44:16,816 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-09 14:44:16,816 INFO L185 Difference]: Start difference. First operand has 138 places, 135 transitions, 330 flow. Second operand 10 states and 1348 transitions. [2020-10-09 14:44:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 152 transitions, 432 flow [2020-10-09 14:44:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 152 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:16,822 INFO L241 Difference]: Finished difference. Result has 149 places, 148 transitions, 422 flow [2020-10-09 14:44:16,823 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=422, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2020-10-09 14:44:16,823 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 20 predicate places. [2020-10-09 14:44:16,824 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 422 flow [2020-10-09 14:44:16,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 14:44:16,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:16,824 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] [2020-10-09 14:44:17,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:44:17,439 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:44:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2019962644, now seen corresponding path program 1 times [2020-10-09 14:44:17,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:17,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334397536] [2020-10-09 14:44:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:17,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:44:17,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:17,595 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:44:17,596 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:17,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:17,603 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:44:17,604 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-09 14:44:17,628 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:17,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:17,650 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:17,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334397536] [2020-10-09 14:44:17,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:17,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:44:17,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691231355] [2020-10-09 14:44:17,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:17,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:17,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 145 [2020-10-09 14:44:17,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 422 flow. Second operand 4 states. [2020-10-09 14:44:17,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:17,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 145 [2020-10-09 14:44:17,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:17,858 INFO L129 PetriNetUnfolder]: 24/721 cut-off events. [2020-10-09 14:44:17,858 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-09 14:44:17,862 INFO L80 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 721 events. 24/721 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2906 event pairs, 0 based on Foata normal form. 20/705 useless extension candidates. Maximal degree in co-relation 868. Up to 26 conditions per place. [2020-10-09 14:44:17,864 INFO L132 encePairwiseOnDemand]: 141/145 looper letters, 2 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2020-10-09 14:44:17,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 406 flow [2020-10-09 14:44:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:44:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:44:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2020-10-09 14:44:17,867 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9425287356321839 [2020-10-09 14:44:17,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2020-10-09 14:44:17,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2020-10-09 14:44:17,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:17,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2020-10-09 14:44:17,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:44:17,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:44:17,872 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:44:17,872 INFO L185 Difference]: Start difference. First operand has 149 places, 148 transitions, 422 flow. Second operand 3 states and 410 transitions. [2020-10-09 14:44:17,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 406 flow [2020-10-09 14:44:17,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 143 transitions, 394 flow, removed 5 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:17,879 INFO L241 Difference]: Finished difference. Result has 149 places, 143 transitions, 390 flow [2020-10-09 14:44:17,880 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2020-10-09 14:44:17,880 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 20 predicate places. [2020-10-09 14:44:17,881 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 390 flow [2020-10-09 14:44:17,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:17,881 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:17,881 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] [2020-10-09 14:44:18,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 14:44:18,096 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:44:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1750362915, now seen corresponding path program 1 times [2020-10-09 14:44:18,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:18,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553134134] [2020-10-09 14:44:18,098 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:44:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:18,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 14:44:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:18,249 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:18,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:18,292 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:18,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553134134] [2020-10-09 14:44:18,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:18,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2020-10-09 14:44:18,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635883688] [2020-10-09 14:44:18,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 14:44:18,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 14:44:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 14:44:18,646 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 145 [2020-10-09 14:44:18,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 390 flow. Second operand 7 states. [2020-10-09 14:44:18,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:18,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 145 [2020-10-09 14:44:18,648 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:18,905 INFO L129 PetriNetUnfolder]: 46/1046 cut-off events. [2020-10-09 14:44:18,905 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2020-10-09 14:44:18,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1046 events. 46/1046 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5038 event pairs, 1 based on Foata normal form. 4/1002 useless extension candidates. Maximal degree in co-relation 920. Up to 44 conditions per place. [2020-10-09 14:44:18,915 INFO L132 encePairwiseOnDemand]: 134/145 looper letters, 27 selfloop transitions, 16 changer transitions 0/159 dead transitions. [2020-10-09 14:44:18,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 159 transitions, 529 flow [2020-10-09 14:44:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 14:44:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 14:44:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1135 transitions. [2020-10-09 14:44:18,920 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8697318007662835 [2020-10-09 14:44:18,920 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1135 transitions. [2020-10-09 14:44:18,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1135 transitions. [2020-10-09 14:44:18,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:18,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1135 transitions. [2020-10-09 14:44:18,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 14:44:18,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 14:44:18,926 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 14:44:18,926 INFO L185 Difference]: Start difference. First operand has 149 places, 143 transitions, 390 flow. Second operand 9 states and 1135 transitions. [2020-10-09 14:44:18,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 159 transitions, 529 flow [2020-10-09 14:44:18,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 159 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:18,933 INFO L241 Difference]: Finished difference. Result has 162 places, 151 transitions, 494 flow [2020-10-09 14:44:18,934 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=494, PETRI_PLACES=162, PETRI_TRANSITIONS=151} [2020-10-09 14:44:18,934 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 33 predicate places. [2020-10-09 14:44:18,935 INFO L481 AbstractCegarLoop]: Abstraction has has 162 places, 151 transitions, 494 flow [2020-10-09 14:44:18,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 14:44:18,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:18,935 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:44:19,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 14:44:19,159 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:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -41181551, now seen corresponding path program 1 times [2020-10-09 14:44:19,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:19,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582589662] [2020-10-09 14:44:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:19,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 59 conjunts are in the unsatisfiable core [2020-10-09 14:44:19,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:19,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:44:19,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:19,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:19,868 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:19,868 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:19,920 INFO L625 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2020-10-09 14:44:19,924 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:19,925 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:59 [2020-10-09 14:44:19,994 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-09 14:44:20,008 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:20,009 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2020-10-09 14:44:20,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:20,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:20,077 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:44:20,140 INFO L625 ElimStorePlain]: treesize reduction 29, result has 70.1 percent of original size [2020-10-09 14:44:20,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,157 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:44:20,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:68 [2020-10-09 14:44:20,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:20,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:21,227 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:21,228 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:44:21,230 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:21,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:21,249 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:44:21,250 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:18 [2020-10-09 14:44:21,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:22,057 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:22,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:24,900 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:44:24,934 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:44:24,939 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 14:44:25,006 INFO L625 ElimStorePlain]: treesize reduction 105, result has 23.9 percent of original size [2020-10-09 14:44:25,007 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:44:25,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:21 [2020-10-09 14:44:25,835 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:25,900 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:26,076 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:26,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582589662] [2020-10-09 14:44:26,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:26,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26, 23] imperfect sequences [] total 47 [2020-10-09 14:44:26,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780990130] [2020-10-09 14:44:26,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-10-09 14:44:26,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-10-09 14:44:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1920, Unknown=1, NotChecked=88, Total=2162 [2020-10-09 14:44:28,266 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 145 [2020-10-09 14:44:28,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 151 transitions, 494 flow. Second operand 47 states. [2020-10-09 14:44:28,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:28,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 145 [2020-10-09 14:44:28,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:29,873 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-09 14:44:30,286 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2020-10-09 14:44:30,764 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-10-09 14:44:31,282 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-10-09 14:44:31,854 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-10-09 14:44:34,152 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse5 (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296))) (let ((.cse3 (<= 400 .cse5)) (.cse2 (< .cse5 400)) (.cse4 (select .cse0 (+ |c_~#arr~0.offset| .cse1)))) (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|) (<= (div |c_t1Thread1of1ForFork0_push_#in~x| (- 4294967296)) (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x| (- 1)) 399) 4294967296)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296))) (or (and (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 1) .cse2) (and (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 0) .cse3)) (< .cse4 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)))) .cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x| 4294967296) (<= (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 399) 4294967296)) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 1))) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res|) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (<= (div .cse4 (- 4294967296)) (div (+ (* .cse4 (- 1)) 399) 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:36,228 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) (< .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) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 399) 4294967296)) (= c_~top~0 0))) is different from false [2020-10-09 14:44:44,405 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|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))))) is different from false [2020-10-09 14:44:46,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse1 (select .cse2 |c_~#arr~0.offset|))) (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)))) (exists ((|ULTIMATE.start_main_~#id2~0.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) 0) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (< .cse1 4294967296) (<= 0 .cse1) (<= (div .cse1 (- 4294967296)) (div (+ (* .cse1 (- 1)) 399) 4294967296)) (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|) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))))) is different from false [2020-10-09 14:44:49,225 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (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 .cse1 (+ |c_~#arr~0.offset| .cse2 (- 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|) (not (= 4294967294 (mod (select .cse1 (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) is different from false [2020-10-09 14:44:50,377 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-09 14:44:51,037 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2020-10-09 14:44:51,484 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2020-10-09 14:44:51,969 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-10-09 14:44:52,818 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2020-10-09 14:44:53,702 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2020-10-09 14:44:56,470 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 95 DAG size of output: 94 [2020-10-09 14:44:57,184 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2020-10-09 14:44:58,055 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2020-10-09 14:44:59,040 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2020-10-09 14:45:00,262 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-10-09 14:45:03,597 WARN L193 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2020-10-09 14:45:04,734 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 114 [2020-10-09 14:45:07,117 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)) (.cse2 (* c_~top~0 4))) (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 .cse2)) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) is different from false [2020-10-09 14:45:09,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse4 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse6 (* c_~top~0 4))) (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))) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse2 (* 4294967296 v_prenex_3))) (let ((.cse3 (* 4294967296 v_prenex_1)) (.cse1 (+ |c_t2Thread1of1ForFork1_pop_#res| .cse2)) (.cse0 (* 4294967296 v_prenex_2))) (and (<= .cse0 .cse1) (<= (+ |c_t2Thread1of1ForFork1_pop_#res| .cse2 .cse3) (+ .cse0 399)) (< .cse0 (+ |c_t2Thread1of1ForFork1_pop_#res| .cse2 .cse3 4294966897)) (<= v_prenex_2 v_prenex_1) (<= 0 .cse1) (< .cse1 4294967296) (< .cse1 (+ .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 |c_t2Thread1of1ForFork1_pop_#res|) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (not (= (mod (select .cse4 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* |c_t2Thread1of1ForFork1_get_top_#res| 4))) 4294967296) 4294967294)) (= .cse5 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse5 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (< |c_t2Thread1of1ForFork1_pop_#res| 4294967296) (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 .cse4 (+ c_t2Thread1of1ForFork1_pop_~stack.offset .cse6)) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse6)) 4294967296))))) is different from false [2020-10-09 14:45:14,434 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|) (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|))) (= .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|) (= c_~top~0 0) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))))) is different from false [2020-10-09 14:45:18,178 INFO L129 PetriNetUnfolder]: 2099/7345 cut-off events. [2020-10-09 14:45:18,178 INFO L130 PetriNetUnfolder]: For 1171/1171 co-relation queries the response was YES. [2020-10-09 14:45:18,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14318 conditions, 7345 events. 2099/7345 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 67048 event pairs, 180 based on Foata normal form. 12/7051 useless extension candidates. Maximal degree in co-relation 8644. Up to 849 conditions per place. [2020-10-09 14:45:18,242 INFO L132 encePairwiseOnDemand]: 103/145 looper letters, 483 selfloop transitions, 189 changer transitions 8/750 dead transitions. [2020-10-09 14:45:18,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 750 transitions, 3335 flow [2020-10-09 14:45:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2020-10-09 14:45:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-09 14:45:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 10051 transitions. [2020-10-09 14:45:18,271 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.5458050502307901 [2020-10-09 14:45:18,272 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 10051 transitions. [2020-10-09 14:45:18,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 10051 transitions. [2020-10-09 14:45:18,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:45:18,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 10051 transitions. [2020-10-09 14:45:18,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 128 states. [2020-10-09 14:45:18,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 128 states. [2020-10-09 14:45:18,323 INFO L81 ComplementDD]: Finished complementDD. Result 128 states. [2020-10-09 14:45:18,323 INFO L185 Difference]: Start difference. First operand has 162 places, 151 transitions, 494 flow. Second operand 127 states and 10051 transitions. [2020-10-09 14:45:18,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 750 transitions, 3335 flow [2020-10-09 14:45:18,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 750 transitions, 3313 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-09 14:45:18,345 INFO L241 Difference]: Finished difference. Result has 322 places, 337 transitions, 1744 flow [2020-10-09 14:45:18,346 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=1744, PETRI_PLACES=322, PETRI_TRANSITIONS=337} [2020-10-09 14:45:18,346 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 193 predicate places. [2020-10-09 14:45:18,346 INFO L481 AbstractCegarLoop]: Abstraction has has 322 places, 337 transitions, 1744 flow [2020-10-09 14:45:18,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-10-09 14:45:18,347 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:45:18,347 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:45:18,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 14:45:18,548 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:45:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:45:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 861649549, now seen corresponding path program 2 times [2020-10-09 14:45:18,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:45:18,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204639598] [2020-10-09 14:45:18,551 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 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:45:18,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 14:45:18,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:45:18,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 58 conjunts are in the unsatisfiable core [2020-10-09 14:45:18,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:45:18,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:45:18,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:45:18,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:45:19,185 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:45:19,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:45:19,240 INFO L625 ElimStorePlain]: treesize reduction 13, result has 81.4 percent of original size [2020-10-09 14:45:19,242 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:45:19,242 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:56 [2020-10-09 14:45:19,745 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:45:19,746 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:45:19,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:45:19,762 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:45:19,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2020-10-09 14:45:19,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:45:20,424 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:45:20,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:45:21,253 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:45:21,263 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-09 14:45:21,289 INFO L625 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2020-10-09 14:45:21,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 14:45:21,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2020-10-09 14:45:22,140 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:45:22,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204639598] [2020-10-09 14:45:22,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:45:22,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [] total 44 [2020-10-09 14:45:22,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758210408] [2020-10-09 14:45:22,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-10-09 14:45:22,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:45:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-10-09 14:45:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2020-10-09 14:48:02,241 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 145 [2020-10-09 14:48:02,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 337 transitions, 1744 flow. Second operand 44 states. [2020-10-09 14:48:02,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:02,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 145 [2020-10-09 14:48:02,243 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:03,359 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:48:03,901 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-09 14:48:04,406 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-10-09 14:48:05,392 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-10-09 14:48:06,352 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-10-09 14:48:07,461 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-10-09 14:48:08,545 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-10-09 14:48:09,525 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-09 14:48:11,047 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-10-09 14:48:11,774 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-10-09 14:48:12,078 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:48:12,515 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-09 14:48:12,887 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-09 14:48:13,425 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:48:13,868 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:48:14,761 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-10-09 14:48:15,097 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-09 14:48:15,602 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-09 14:48:16,066 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:48:16,501 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:48:17,190 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:48:17,844 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:48:18,294 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:48:18,843 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:48:19,162 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:48:19,740 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:48:20,195 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:48:20,780 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:48:22,036 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:48:24,846 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 96 [2020-10-09 14:48:27,434 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 88 [2020-10-09 14:48:30,097 WARN L193 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 86 [2020-10-09 14:48:34,848 WARN L193 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 100 [2020-10-09 14:48:37,916 WARN L193 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 79 [2020-10-09 14:48:38,256 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:48:41,090 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 91 [2020-10-09 14:48:41,736 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:48:42,286 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:48:45,211 WARN L193 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 97 [2020-10-09 14:48:50,508 WARN L193 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2020-10-09 14:48:50,900 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-09 14:48:56,629 WARN L193 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-10-09 14:49:02,718 WARN L193 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2020-10-09 14:49:08,245 WARN L193 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-10-09 14:49:14,711 WARN L193 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2020-10-09 14:49:15,062 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:49:15,537 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:49:21,962 WARN L193 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2020-10-09 14:49:22,340 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:49:29,150 WARN L193 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-10-09 14:49:29,479 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-09 14:49:29,864 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:49:30,188 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:49:30,719 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:49:31,089 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:49:32,540 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:49:32,968 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:49:33,351 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:49:40,372 WARN L193 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2020-10-09 14:49:44,224 WARN L193 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2020-10-09 14:49:44,699 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:49:47,528 WARN L193 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 84 [2020-10-09 14:49:48,012 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:49:48,402 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:49:48,822 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:49:49,403 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:49:49,775 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-09 14:49:50,092 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:49:50,851 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:49:51,706 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:49:52,637 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-09 14:49:54,092 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2020-10-09 14:49:55,187 WARN L193 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-09 14:49:56,428 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-09 14:49:58,084 WARN L193 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-09 14:49:58,818 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:50:01,565 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 77 [2020-10-09 14:50:02,036 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-10-09 14:50:05,097 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 96 [2020-10-09 14:50:05,602 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:50:06,861 WARN L193 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-09 14:50:08,603 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-10-09 14:50:09,723 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:50:11,615 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-09 14:50:12,060 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:50:12,766 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:50:15,753 WARN L193 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 90 [2020-10-09 14:50:18,250 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-09 14:50:21,000 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 76 [2020-10-09 14:50:23,220 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2020-10-09 14:50:24,059 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:50:25,008 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-09 14:50:25,948 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:50:26,449 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:50:27,343 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-09 14:50:27,769 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:50:28,289 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:50:31,215 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 95 [2020-10-09 14:50:31,695 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-09 14:50:32,699 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-09 14:50:33,329 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:50:34,684 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-09 14:50:35,141 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:50:35,682 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:50:38,519 WARN L193 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 97 [2020-10-09 14:50:39,111 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:50:39,701 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:50:40,708 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-09 14:50:41,199 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:50:45,246 WARN L193 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 88 [2020-10-09 14:50:45,626 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:50:48,243 WARN L193 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-09 14:50:49,282 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:50:50,636 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:50:51,971 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-09 14:50:53,536 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:50:54,622 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:50:55,185 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:50:57,963 WARN L193 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 74 [2020-10-09 14:50:58,477 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:01,262 WARN L193 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 89 [2020-10-09 14:51:01,834 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:51:04,724 WARN L193 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 84 [2020-10-09 14:51:06,101 WARN L193 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-09 14:51:06,552 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:51:07,209 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:08,546 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-09 14:51:09,177 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:12,113 WARN L193 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 87 [2020-10-09 14:51:13,944 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-09 14:51:15,352 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-09 14:51:15,806 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-09 14:51:16,616 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:51:18,052 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-09 14:51:18,554 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:51:19,453 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-09 14:51:20,501 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:21,502 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-09 14:51:22,008 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:51:24,843 WARN L193 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 91 [2020-10-09 14:51:25,320 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:51:25,942 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:51:26,671 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-09 14:51:27,216 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:51:27,807 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-09 14:51:28,405 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:51:29,050 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-09 14:51:29,988 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-09 14:51:30,551 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-09 14:51:31,073 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:51:31,773 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:51:32,457 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:33,161 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:51:33,710 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:51:34,526 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:51:35,093 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-09 14:51:35,604 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:51:38,356 WARN L193 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 78 [2020-10-09 14:51:38,838 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:51:39,554 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-09 14:51:40,154 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:51:40,820 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:51:41,533 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-09 14:51:42,118 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:51:42,797 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:51:45,418 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-09 14:51:46,021 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-09 14:51:46,415 INFO L129 PetriNetUnfolder]: 707/5588 cut-off events. [2020-10-09 14:51:46,415 INFO L130 PetriNetUnfolder]: For 16961/17385 co-relation queries the response was YES. [2020-10-09 14:51:46,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16731 conditions, 5588 events. 707/5588 cut-off events. For 16961/17385 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 47756 event pairs, 93 based on Foata normal form. 37/5388 useless extension candidates. Maximal degree in co-relation 16489. Up to 635 conditions per place. [2020-10-09 14:51:46,502 INFO L132 encePairwiseOnDemand]: 108/145 looper letters, 207 selfloop transitions, 473 changer transitions 10/799 dead transitions. [2020-10-09 14:51:46,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 799 transitions, 6025 flow [2020-10-09 14:51:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2020-10-09 14:51:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-09 14:51:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 17055 transitions. [2020-10-09 14:51:46,550 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.642736009044658 [2020-10-09 14:51:46,550 INFO L72 ComplementDD]: Start complementDD. Operand 183 states and 17055 transitions. [2020-10-09 14:51:46,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 17055 transitions. [2020-10-09 14:51:46,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:51:46,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 183 states and 17055 transitions. [2020-10-09 14:51:46,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 184 states. [2020-10-09 14:51:46,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 184 states. [2020-10-09 14:51:46,604 INFO L81 ComplementDD]: Finished complementDD. Result 184 states. [2020-10-09 14:51:46,604 INFO L185 Difference]: Start difference. First operand has 322 places, 337 transitions, 1744 flow. Second operand 183 states and 17055 transitions. [2020-10-09 14:51:46,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 799 transitions, 6025 flow [2020-10-09 14:51:46,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 799 transitions, 5913 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-09 14:51:46,667 INFO L241 Difference]: Finished difference. Result has 530 places, 649 transitions, 4864 flow [2020-10-09 14:51:46,668 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=183, PETRI_FLOW=4864, PETRI_PLACES=530, PETRI_TRANSITIONS=649} [2020-10-09 14:51:46,669 INFO L341 CegarLoopForPetriNet]: 129 programPoint places, 401 predicate places. [2020-10-09 14:51:46,669 INFO L481 AbstractCegarLoop]: Abstraction has has 530 places, 649 transitions, 4864 flow [2020-10-09 14:51:46,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-10-09 14:51:46,669 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:51:46,669 INFO L255 CegarLoopForPetriNet]: trace histogram [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, 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:46,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-09 14:51:46,880 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:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:51:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2020711205, now seen corresponding path program 1 times [2020-10-09 14:51:46,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:51:46,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969194021] [2020-10-09 14:51:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-09 14:51:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 14:51:47,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 14:51:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 14:51:47,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 14:51:47,329 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 14:51:47,329 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 14:51:47,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-09 14:51:47,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:51:47 BasicIcfg [2020-10-09 14:51:47,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:51:47,681 INFO L168 Benchmark]: Toolchain (without parser) took 456027.36 ms. Allocated memory was 251.1 MB in the beginning and 589.3 MB in the end (delta: 338.2 MB). Free memory was 205.9 MB in the beginning and 385.4 MB in the end (delta: -179.6 MB). Peak memory consumption was 475.0 MB. Max. memory is 14.2 GB. [2020-10-09 14:51:47,681 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:51:47,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.85 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.9 MB in the beginning and 242.5 MB in the end (delta: -36.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:51:47,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.63 ms. Allocated memory is still 314.6 MB. Free memory was 242.5 MB in the beginning and 240.0 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:51:47,682 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 314.6 MB. Free memory was 240.0 MB in the beginning and 237.5 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:51:47,682 INFO L168 Benchmark]: RCFGBuilder took 602.77 ms. Allocated memory is still 314.6 MB. Free memory was 237.5 MB in the beginning and 203.0 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 14.2 GB. [2020-10-09 14:51:47,683 INFO L168 Benchmark]: TraceAbstraction took 454425.12 ms. Allocated memory was 314.6 MB in the beginning and 589.3 MB in the end (delta: 274.7 MB). Free memory was 203.0 MB in the beginning and 385.4 MB in the end (delta: -182.4 MB). Peak memory consumption was 408.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:51:47,685 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.32 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 885.85 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.9 MB in the beginning and 242.5 MB in the end (delta: -36.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.63 ms. Allocated memory is still 314.6 MB. Free memory was 242.5 MB in the beginning and 240.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 314.6 MB. Free memory was 240.0 MB in the beginning and 237.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 602.77 ms. Allocated memory is still 314.6 MB. Free memory was 237.5 MB in the beginning and 203.0 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 454425.12 ms. Allocated memory was 314.6 MB in the beginning and 589.3 MB in the end (delta: 274.7 MB). Free memory was 203.0 MB in the beginning and 385.4 MB in the end (delta: -182.4 MB). Peak memory consumption was 408.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 921]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L916] 0 static int top=0; VAL [top=0] [L917] 0 static unsigned int arr[(400)]; VAL [arr={1625:0}, top=0] [L918] 0 pthread_mutex_t m; VAL [arr={1625:0}, m={1624:0}, top=0] [L919] 0 _Bool flag=(0); VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L1000] 0 pthread_t id1, id2; VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L1002] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L969] 1 int i; VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L1003] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L970] 1 unsigned int tmp; VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L971] 1 i=0 VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L971] COND TRUE 1 i<(400) VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L974] 1 tmp = __VERIFIER_nondet_uint() VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L4] COND FALSE 1 !(!cond) VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L941] COND FALSE 1 !(top==(400)) VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L933] 1 return top; VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L948] 1 stack[get_top()] = x VAL [arr={1625:0}, flag=0, m={1624:0}, top=0] [L925] 1 top++ VAL [arr={1625:0}, flag=0, m={1624:0}, top=1] [L951] 1 return 0; VAL [arr={1625:0}, flag=0, m={1624:0}, top=1] [L976] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arr={1625:0}, flag=0, m={1624:0}, top=1] [L978] 1 flag=(1) VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L985] 2 int i; VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L986] 2 i=0 VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L986] COND TRUE 2 i<(400) VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L989] COND TRUE 2 \read(flag) VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L933] 2 return top; VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L955] COND FALSE 2 !(get_top()==0) VAL [arr={1625:0}, flag=1, m={1624:0}, top=1] [L929] 2 top-- VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L933] 2 return top; VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L963] EXPR 2 stack[get_top()] VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L963] 2 return stack[get_top()]; VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L991] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L986] 2 i++ VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L986] COND TRUE 2 i<(400) VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L989] COND TRUE 2 \read(flag) VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L933] 2 return top; VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L955] COND TRUE 2 get_top()==0 VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L958] 2 return (-2); VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L991] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] [L921] 2 __VERIFIER_error() VAL [arr={1625:0}, flag=1, m={1624:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 134 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: UNSAFE, OverallTime: 454.1s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 438.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 356 SDtfs, 3299 SDslu, 19785 SDs, 0 SdLazy, 17631 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 1427 SyntacticMatches, 8 SemanticMatches, 408 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 25196 ImplicationChecksByTransitivity, 251.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4864occurred 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1504 ConstructedInterpolants, 51 QuantifiedInterpolants, 925286 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1823 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 18/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...