/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/fib_bench_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:16:20,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:16:20,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:16:20,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:16:20,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:16:20,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:16:20,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:16:20,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:16:20,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:16:20,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:16:20,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:16:20,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:16:20,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:16:20,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:16:20,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:16:20,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:16:20,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:16:20,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:16:20,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:16:20,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:16:20,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:16:20,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:16:20,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:16:20,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:16:20,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:16:20,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:16:20,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:16:20,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:16:20,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:16:20,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:16:20,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:16:20,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:16:20,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:16:20,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:16:20,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:16:20,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:16:20,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:16:20,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:16:20,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:16:20,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:16:20,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:16:20,386 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:16:20,436 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:16:20,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:16:20,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:16:20,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:16:20,443 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:16:20,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:16:20,443 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:16:20,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:16:20,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:16:20,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:16:20,444 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:16:20,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:16:20,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:16:20,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:16:20,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:16:20,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:16:20,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:16:20,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:16:20,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:16:20,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:16:20,446 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:16:20,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:16:20,447 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:16:20,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:16:20,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:16:20,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:16:20,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:16:20,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:16:20,741 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:16:20,741 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:16:20,742 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_bench_longer-1.i [2020-10-09 14:16:20,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7608610/23562d624baf4818855210c29f606376/FLAG8b8359747 [2020-10-09 14:16:21,348 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:16:21,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_bench_longer-1.i [2020-10-09 14:16:21,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7608610/23562d624baf4818855210c29f606376/FLAG8b8359747 [2020-10-09 14:16:21,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7608610/23562d624baf4818855210c29f606376 [2020-10-09 14:16:21,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:16:21,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:16:21,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:16:21,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:16:21,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:16:21,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:16:21" (1/1) ... [2020-10-09 14:16:21,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dca5573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:21, skipping insertion in model container [2020-10-09 14:16:21,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:16:21" (1/1) ... [2020-10-09 14:16:21,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:16:21,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:16:22,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:16:22,201 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:16:22,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:16:22,351 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:16:22,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22 WrapperNode [2020-10-09 14:16:22,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:16:22,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:16:22,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:16:22,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:16:22,362 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:16:22" (1/1) ... [2020-10-09 14:16:22,386 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:16:22" (1/1) ... [2020-10-09 14:16:22,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:16:22,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:16:22,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:16:22,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:16:22,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:16:22,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:16:22,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:16:22,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:16:22,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (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:16:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:16:22,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:16:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:16:22,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:16:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:16:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 14:16:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:16:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:16:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 14:16:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:16:22,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:16:22,515 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:16:22,833 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:16:22,834 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-09 14:16:22,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:16:22 BoogieIcfgContainer [2020-10-09 14:16:22,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:16:22,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:16:22,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:16:22,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:16:22,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:16:21" (1/3) ... [2020-10-09 14:16:22,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb056f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:16:22, skipping insertion in model container [2020-10-09 14:16:22,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (2/3) ... [2020-10-09 14:16:22,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb056f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:16:22, skipping insertion in model container [2020-10-09 14:16:22,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:16:22" (3/3) ... [2020-10-09 14:16:22,845 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_bench_longer-1.i [2020-10-09 14:16:22,857 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:16:22,865 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-09 14:16:22,866 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:16:22,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,894 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,897 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,898 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,898 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,898 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,899 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,899 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,899 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,899 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,900 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,900 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,900 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,900 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,902 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,902 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,903 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,906 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,907 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,907 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,913 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,914 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,914 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,914 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,914 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,933 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-09 14:16:22,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:16:22,955 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:16:22,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:16:22,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:16:22,956 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:16:22,956 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:16:22,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:16:22,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:16:22,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 59 places, 57 transitions, 124 flow [2020-10-09 14:16:23,004 INFO L129 PetriNetUnfolder]: 5/55 cut-off events. [2020-10-09 14:16:23,004 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:23,009 INFO L80 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 55 events. 5/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2020-10-09 14:16:23,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 57 transitions, 124 flow [2020-10-09 14:16:23,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 116 flow [2020-10-09 14:16:23,032 INFO L129 PetriNetUnfolder]: 4/44 cut-off events. [2020-10-09 14:16:23,032 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:23,032 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:23,033 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] [2020-10-09 14:16:23,034 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 627590565, now seen corresponding path program 1 times [2020-10-09 14:16:23,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:23,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866143144] [2020-10-09 14:16:23,062 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:16:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:23,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 14:16:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:23,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:23,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:23,316 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:16:23,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:23,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:23,385 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:16:23,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866143144] [2020-10-09 14:16:23,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:23,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-09 14:16:23,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754773382] [2020-10-09 14:16:23,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 14:16:23,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:23,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 14:16:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-09 14:16:23,596 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:23,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 116 flow. Second operand 9 states. [2020-10-09 14:16:23,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:23,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:23,601 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:24,074 INFO L129 PetriNetUnfolder]: 84/383 cut-off events. [2020-10-09 14:16:24,075 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:24,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 383 events. 84/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2260 event pairs, 0 based on Foata normal form. 91/435 useless extension candidates. Maximal degree in co-relation 501. Up to 47 conditions per place. [2020-10-09 14:16:24,082 INFO L132 encePairwiseOnDemand]: 46/57 looper letters, 16 selfloop transitions, 23 changer transitions 43/118 dead transitions. [2020-10-09 14:16:24,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 118 transitions, 392 flow [2020-10-09 14:16:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-09 14:16:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 14:16:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1119 transitions. [2020-10-09 14:16:24,107 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8923444976076556 [2020-10-09 14:16:24,108 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:24,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-09 14:16:24,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-09 14:16:24,134 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-09 14:16:24,136 INFO L185 Difference]: Start difference. First operand has 57 places, 55 transitions, 116 flow. Second operand 22 states and 1119 transitions. [2020-10-09 14:16:24,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 118 transitions, 392 flow [2020-10-09 14:16:24,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 14:16:24,149 INFO L241 Difference]: Finished difference. Result has 94 places, 69 transitions, 266 flow [2020-10-09 14:16:24,152 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=266, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2020-10-09 14:16:24,153 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2020-10-09 14:16:24,153 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 266 flow [2020-10-09 14:16:24,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 14:16:24,154 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:24,157 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:16:24,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:16:24,358 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -933138607, now seen corresponding path program 1 times [2020-10-09 14:16:24,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:24,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383801537] [2020-10-09 14:16:24,360 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:16:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:24,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:16:24,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:24,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:24,565 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:16:24,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:24,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,673 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:16:24,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383801537] [2020-10-09 14:16:24,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:24,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-10-09 14:16:24,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567263491] [2020-10-09 14:16:24,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 14:16:24,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 14:16:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-09 14:16:24,937 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:24,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 266 flow. Second operand 13 states. [2020-10-09 14:16:24,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:24,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:24,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:25,745 INFO L129 PetriNetUnfolder]: 91/448 cut-off events. [2020-10-09 14:16:25,745 INFO L130 PetriNetUnfolder]: For 1129/1137 co-relation queries the response was YES. [2020-10-09 14:16:25,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 448 events. 91/448 cut-off events. For 1129/1137 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2615 event pairs, 0 based on Foata normal form. 22/419 useless extension candidates. Maximal degree in co-relation 894. Up to 81 conditions per place. [2020-10-09 14:16:25,752 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 21 selfloop transitions, 56 changer transitions 37/150 dead transitions. [2020-10-09 14:16:25,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 978 flow [2020-10-09 14:16:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-09 14:16:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-09 14:16:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1679 transitions. [2020-10-09 14:16:25,758 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8416040100250627 [2020-10-09 14:16:25,758 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:25,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 36 states. [2020-10-09 14:16:25,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 36 states. [2020-10-09 14:16:25,768 INFO L81 ComplementDD]: Finished complementDD. Result 36 states. [2020-10-09 14:16:25,768 INFO L185 Difference]: Start difference. First operand has 94 places, 69 transitions, 266 flow. Second operand 35 states and 1679 transitions. [2020-10-09 14:16:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 150 transitions, 978 flow [2020-10-09 14:16:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 150 transitions, 924 flow, removed 27 selfloop flow, removed 9 redundant places. [2020-10-09 14:16:25,779 INFO L241 Difference]: Finished difference. Result has 123 places, 107 transitions, 643 flow [2020-10-09 14:16:25,779 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=643, PETRI_PLACES=123, PETRI_TRANSITIONS=107} [2020-10-09 14:16:25,780 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2020-10-09 14:16:25,780 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 107 transitions, 643 flow [2020-10-09 14:16:25,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 14:16:25,781 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:25,781 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:16:25,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:16:25,996 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash -979469551, now seen corresponding path program 2 times [2020-10-09 14:16:25,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:25,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165694034] [2020-10-09 14:16:25,998 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 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:16:26,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 14:16:26,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:16:26,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:16:26,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:26,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:16:26,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:26,139 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:16:26,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:26,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,256 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:16:26,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165694034] [2020-10-09 14:16:26,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:26,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-10-09 14:16:26,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134526313] [2020-10-09 14:16:26,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 14:16:26,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:26,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 14:16:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-09 14:16:26,360 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:26,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 107 transitions, 643 flow. Second operand 13 states. [2020-10-09 14:16:26,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:26,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:26,361 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:27,832 INFO L129 PetriNetUnfolder]: 196/1097 cut-off events. [2020-10-09 14:16:27,833 INFO L130 PetriNetUnfolder]: For 6279/6287 co-relation queries the response was YES. [2020-10-09 14:16:27,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 1097 events. 196/1097 cut-off events. For 6279/6287 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8778 event pairs, 0 based on Foata normal form. 35/1015 useless extension candidates. Maximal degree in co-relation 2605. Up to 207 conditions per place. [2020-10-09 14:16:27,849 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 24 selfloop transitions, 160 changer transitions 60/280 dead transitions. [2020-10-09 14:16:27,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 280 transitions, 2673 flow [2020-10-09 14:16:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-09 14:16:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-09 14:16:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 2450 transitions. [2020-10-09 14:16:27,859 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8427932576539388 [2020-10-09 14:16:27,859 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 2450 transitions. [2020-10-09 14:16:27,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 2450 transitions. [2020-10-09 14:16:27,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:27,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 2450 transitions. [2020-10-09 14:16:27,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 52 states. [2020-10-09 14:16:27,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 52 states. [2020-10-09 14:16:27,875 INFO L81 ComplementDD]: Finished complementDD. Result 52 states. [2020-10-09 14:16:27,875 INFO L185 Difference]: Start difference. First operand has 123 places, 107 transitions, 643 flow. Second operand 51 states and 2450 transitions. [2020-10-09 14:16:27,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 280 transitions, 2673 flow [2020-10-09 14:16:27,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 280 transitions, 2477 flow, removed 74 selfloop flow, removed 20 redundant places. [2020-10-09 14:16:27,930 INFO L241 Difference]: Finished difference. Result has 172 places, 216 transitions, 1814 flow [2020-10-09 14:16:27,931 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1814, PETRI_PLACES=172, PETRI_TRANSITIONS=216} [2020-10-09 14:16:27,931 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 115 predicate places. [2020-10-09 14:16:27,931 INFO L481 AbstractCegarLoop]: Abstraction has has 172 places, 216 transitions, 1814 flow [2020-10-09 14:16:27,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 14:16:27,932 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:27,932 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2020-10-09 14:16:28,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 14:16:28,144 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash 363117953, now seen corresponding path program 1 times [2020-10-09 14:16:28,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:28,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315330008] [2020-10-09 14:16:28,146 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:16:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:28,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:28,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:28,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:28,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315330008] [2020-10-09 14:16:28,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1573589846] [2020-10-09 14:16:28,619 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:16:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:28,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:28,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:28,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:28,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036666823] [2020-10-09 14:16:28,902 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:16:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:28,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:28,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:28,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:29,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:16:29,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 17 [2020-10-09 14:16:29,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925527396] [2020-10-09 14:16:29,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-09 14:16:29,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-09 14:16:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-10-09 14:16:29,467 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:29,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 216 transitions, 1814 flow. Second operand 17 states. [2020-10-09 14:16:29,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:29,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:29,468 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:32,942 INFO L129 PetriNetUnfolder]: 365/2198 cut-off events. [2020-10-09 14:16:32,943 INFO L130 PetriNetUnfolder]: For 22815/22856 co-relation queries the response was YES. [2020-10-09 14:16:32,962 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6080 conditions, 2198 events. 365/2198 cut-off events. For 22815/22856 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 19482 event pairs, 0 based on Foata normal form. 56/2021 useless extension candidates. Maximal degree in co-relation 6003. Up to 402 conditions per place. [2020-10-09 14:16:32,973 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 30 selfloop transitions, 401 changer transitions 77/544 dead transitions. [2020-10-09 14:16:32,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 544 transitions, 6618 flow [2020-10-09 14:16:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-10-09 14:16:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-09 14:16:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 3451 transitions. [2020-10-09 14:16:32,984 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8408869395711501 [2020-10-09 14:16:32,984 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 3451 transitions. [2020-10-09 14:16:32,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 3451 transitions. [2020-10-09 14:16:32,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:32,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 3451 transitions. [2020-10-09 14:16:32,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 73 states. [2020-10-09 14:16:32,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 73 states. [2020-10-09 14:16:32,999 INFO L81 ComplementDD]: Finished complementDD. Result 73 states. [2020-10-09 14:16:32,999 INFO L185 Difference]: Start difference. First operand has 172 places, 216 transitions, 1814 flow. Second operand 72 states and 3451 transitions. [2020-10-09 14:16:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 544 transitions, 6618 flow [2020-10-09 14:16:33,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 544 transitions, 5666 flow, removed 455 selfloop flow, removed 27 redundant places. [2020-10-09 14:16:33,087 INFO L241 Difference]: Finished difference. Result has 236 places, 463 transitions, 4606 flow [2020-10-09 14:16:33,088 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=4606, PETRI_PLACES=236, PETRI_TRANSITIONS=463} [2020-10-09 14:16:33,088 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places. [2020-10-09 14:16:33,088 INFO L481 AbstractCegarLoop]: Abstraction has has 236 places, 463 transitions, 4606 flow [2020-10-09 14:16:33,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-09 14:16:33,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:33,089 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 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] [2020-10-09 14:16:33,701 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:16:33,702 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1061462731, now seen corresponding path program 1 times [2020-10-09 14:16:33,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:33,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87053582] [2020-10-09 14:16:33,704 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:16:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:33,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:33,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:33,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:33,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:33,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:33,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:36,366 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:16:36,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,876 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:16:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:38,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87053582] [2020-10-09 14:16:38,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766663938] [2020-10-09 14:16:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:16:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:39,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:39,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:39,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:39,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:39,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:39,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:39,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:39,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:39,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:39,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:39,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:42,659 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:16:42,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,698 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:16:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:45,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910339119] [2020-10-09 14:16:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:16:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:45,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:45,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:45,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:45,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:45,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:45,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:45,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:46,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:46,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:16:46,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 23 [2020-10-09 14:16:46,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933734458] [2020-10-09 14:16:46,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 14:16:46,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 14:16:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=380, Unknown=3, NotChecked=0, Total=506 [2020-10-09 14:16:50,601 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:50,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 463 transitions, 4606 flow. Second operand 23 states. [2020-10-09 14:16:50,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:50,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:50,602 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:59,948 WARN L193 SmtUtils]: Spent 7.33 s on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2020-10-09 14:17:09,674 WARN L193 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2020-10-09 14:17:20,770 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2020-10-09 14:17:22,828 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2020-10-09 14:17:26,427 WARN L193 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2020-10-09 14:17:31,195 WARN L193 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-10-09 14:17:47,081 WARN L193 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2020-10-09 14:17:49,907 WARN L193 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-09 14:17:53,096 WARN L193 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-09 14:17:55,399 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-10-09 14:17:57,203 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-10-09 14:18:12,207 WARN L193 SmtUtils]: Spent 8.84 s on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2020-10-09 14:18:17,791 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-10-09 14:18:20,229 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-09 14:18:22,691 WARN L193 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-10-09 14:18:29,938 WARN L193 SmtUtils]: Spent 6.94 s on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2020-10-09 14:18:34,438 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-10-09 14:18:38,641 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-10-09 14:18:44,308 WARN L193 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-10-09 14:18:51,426 WARN L193 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-10-09 14:18:56,611 WARN L193 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-10-09 14:19:00,551 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:19:01,431 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2020-10-09 14:19:01,616 INFO L129 PetriNetUnfolder]: 724/4519 cut-off events. [2020-10-09 14:19:01,616 INFO L130 PetriNetUnfolder]: For 78956/79116 co-relation queries the response was YES. [2020-10-09 14:19:01,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13115 conditions, 4519 events. 724/4519 cut-off events. For 78956/79116 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 44760 event pairs, 0 based on Foata normal form. 108/4144 useless extension candidates. Maximal degree in co-relation 13020. Up to 718 conditions per place. [2020-10-09 14:19:01,673 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 44 selfloop transitions, 907 changer transitions 137/1124 dead transitions. [2020-10-09 14:19:01,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1124 transitions, 14534 flow [2020-10-09 14:19:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2020-10-09 14:19:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-09 14:19:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 4648 transitions. [2020-10-09 14:19:01,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8406583468981733 [2020-10-09 14:19:01,682 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 4648 transitions. [2020-10-09 14:19:01,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 4648 transitions. [2020-10-09 14:19:01,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:19:01,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 4648 transitions. [2020-10-09 14:19:01,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 98 states. [2020-10-09 14:19:01,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 98 states. [2020-10-09 14:19:01,699 INFO L81 ComplementDD]: Finished complementDD. Result 98 states. [2020-10-09 14:19:01,699 INFO L185 Difference]: Start difference. First operand has 236 places, 463 transitions, 4606 flow. Second operand 97 states and 4648 transitions. [2020-10-09 14:19:01,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1124 transitions, 14534 flow [2020-10-09 14:19:01,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1124 transitions, 13904 flow, removed 261 selfloop flow, removed 36 redundant places. [2020-10-09 14:19:01,900 INFO L241 Difference]: Finished difference. Result has 329 places, 983 transitions, 11576 flow [2020-10-09 14:19:01,901 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4414, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=424, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=11576, PETRI_PLACES=329, PETRI_TRANSITIONS=983} [2020-10-09 14:19:01,902 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 272 predicate places. [2020-10-09 14:19:01,902 INFO L481 AbstractCegarLoop]: Abstraction has has 329 places, 983 transitions, 11576 flow [2020-10-09 14:19:01,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 14:19:01,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:19:01,902 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 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] [2020-10-09 14:19:02,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:19:02,511 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:19:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:19:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash 581000542, now seen corresponding path program 2 times [2020-10-09 14:19:02,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:19:02,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886757287] [2020-10-09 14:19:02,513 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:19:02,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:19:02,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:19:02,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:19:02,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:19:02,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:02,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:02,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:19:02,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:03,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,053 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:19:05,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:05,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886757287] [2020-10-09 14:19:05,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [94625823] [2020-10-09 14:19:05,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:19:05,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:19:05,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:19:05,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:19:05,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:19:05,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:05,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:05,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:19:05,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:05,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:06,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398033594] [2020-10-09 14:19:06,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:19:06,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:19:06,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:19:06,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:19:06,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:19:06,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:06,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:19:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:06,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:19:06,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:06,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:07,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:19:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:19:07,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:19:07,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 23 [2020-10-09 14:19:07,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859705508] [2020-10-09 14:19:07,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 14:19:07,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:19:07,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 14:19:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2020-10-09 14:19:07,338 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:19:07,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 983 transitions, 11576 flow. Second operand 23 states. [2020-10-09 14:19:07,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:19:07,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:19:07,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:19:09,618 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-10-09 14:19:10,124 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-10-09 14:19:13,263 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-10-09 14:19:29,155 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2020-10-09 14:19:32,285 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-10-09 14:19:36,172 WARN L193 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-10-09 14:19:47,325 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-10-09 14:19:51,053 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-10-09 14:19:53,768 WARN L193 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-10-09 14:19:54,519 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2020-10-09 14:20:01,985 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-10-09 14:20:06,445 WARN L193 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2020-10-09 14:20:19,616 INFO L129 PetriNetUnfolder]: 1220/7950 cut-off events. [2020-10-09 14:20:19,617 INFO L130 PetriNetUnfolder]: For 147153/147445 co-relation queries the response was YES. [2020-10-09 14:20:19,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 23084 conditions, 7950 events. 1220/7950 cut-off events. For 147153/147445 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 89864 event pairs, 0 based on Foata normal form. 135/7232 useless extension candidates. Maximal degree in co-relation 22955. Up to 1001 conditions per place. [2020-10-09 14:20:19,895 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 234 selfloop transitions, 1655 changer transitions 90/2015 dead transitions. [2020-10-09 14:20:19,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 2015 transitions, 28797 flow [2020-10-09 14:20:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2020-10-09 14:20:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-09 14:20:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 5600 transitions. [2020-10-09 14:20:19,923 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8397061028639976 [2020-10-09 14:20:19,923 INFO L72 ComplementDD]: Start complementDD. Operand 117 states and 5600 transitions. [2020-10-09 14:20:19,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 5600 transitions. [2020-10-09 14:20:19,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:20:19,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 117 states and 5600 transitions. [2020-10-09 14:20:19,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 118 states. [2020-10-09 14:20:19,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 118 states. [2020-10-09 14:20:19,953 INFO L81 ComplementDD]: Finished complementDD. Result 118 states. [2020-10-09 14:20:19,953 INFO L185 Difference]: Start difference. First operand has 329 places, 983 transitions, 11576 flow. Second operand 117 states and 5600 transitions. [2020-10-09 14:20:19,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 2015 transitions, 28797 flow [2020-10-09 14:20:20,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 2015 transitions, 28528 flow, removed 111 selfloop flow, removed 39 redundant places. [2020-10-09 14:20:20,788 INFO L241 Difference]: Finished difference. Result has 438 places, 1908 transitions, 26046 flow [2020-10-09 14:20:20,789 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=11429, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=875, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=117, PETRI_FLOW=26046, PETRI_PLACES=438, PETRI_TRANSITIONS=1908} [2020-10-09 14:20:20,789 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 381 predicate places. [2020-10-09 14:20:20,789 INFO L481 AbstractCegarLoop]: Abstraction has has 438 places, 1908 transitions, 26046 flow [2020-10-09 14:20:20,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 14:20:20,790 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:20:20,790 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 3, 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] [2020-10-09 14:20:21,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2020-10-09 14:20:21,393 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:20:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:20:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2043642001, now seen corresponding path program 3 times [2020-10-09 14:20:21,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:20:21,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125987387] [2020-10-09 14:20:21,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-09 14:20:21,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-09 14:20:21,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:20:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:20:21,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:20:21,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:21,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:21,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:20:21,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:22,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125987387] [2020-10-09 14:20:22,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297350302] [2020-10-09 14:20:22,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:20:22,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-09 14:20:22,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:20:22,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:20:22,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:20:22,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:22,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:22,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:20:22,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:22,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858157769] [2020-10-09 14:20:22,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:20:23,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-09 14:20:23,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:20:23,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:20:23,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:20:23,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:23,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:20:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:23,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:20:23,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:20:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:20:23,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:20:23,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 25 [2020-10-09 14:20:23,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562845426] [2020-10-09 14:20:23,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-09 14:20:23,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:20:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-09 14:20:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2020-10-09 14:20:25,400 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:20:25,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 1908 transitions, 26046 flow. Second operand 25 states. [2020-10-09 14:20:25,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:20:25,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:20:25,401 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:20:42,132 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2020-10-09 14:20:44,126 INFO L129 PetriNetUnfolder]: 1907/12428 cut-off events. [2020-10-09 14:20:44,126 INFO L130 PetriNetUnfolder]: For 415074/415663 co-relation queries the response was YES. [2020-10-09 14:20:44,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 41838 conditions, 12428 events. 1907/12428 cut-off events. For 415074/415663 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 153686 event pairs, 0 based on Foata normal form. 208/11305 useless extension candidates. Maximal degree in co-relation 41675. Up to 1873 conditions per place. [2020-10-09 14:20:44,649 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 706 selfloop transitions, 2273 changer transitions 157/3172 dead transitions. [2020-10-09 14:20:44,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 3172 transitions, 52089 flow [2020-10-09 14:20:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2020-10-09 14:20:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-09 14:20:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 5843 transitions. [2020-10-09 14:20:44,665 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8402358354903653 [2020-10-09 14:20:44,666 INFO L72 ComplementDD]: Start complementDD. Operand 122 states and 5843 transitions. [2020-10-09 14:20:44,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 5843 transitions. [2020-10-09 14:20:44,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:20:44,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 122 states and 5843 transitions. [2020-10-09 14:20:44,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 123 states. [2020-10-09 14:20:44,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 123 states. [2020-10-09 14:20:44,685 INFO L81 ComplementDD]: Finished complementDD. Result 123 states. [2020-10-09 14:20:44,685 INFO L185 Difference]: Start difference. First operand has 438 places, 1908 transitions, 26046 flow. Second operand 122 states and 5843 transitions. [2020-10-09 14:20:44,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 3172 transitions, 52089 flow [2020-10-09 14:20:47,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 3172 transitions, 51348 flow, removed 263 selfloop flow, removed 58 redundant places. [2020-10-09 14:20:47,307 INFO L241 Difference]: Finished difference. Result has 547 places, 2973 transitions, 46583 flow [2020-10-09 14:20:47,309 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=25564, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=122, PETRI_FLOW=46583, PETRI_PLACES=547, PETRI_TRANSITIONS=2973} [2020-10-09 14:20:47,310 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 490 predicate places. [2020-10-09 14:20:47,310 INFO L481 AbstractCegarLoop]: Abstraction has has 547 places, 2973 transitions, 46583 flow [2020-10-09 14:20:47,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-09 14:20:47,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:20:47,311 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:20:47,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:20:47,928 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:20:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:20:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1215005947, now seen corresponding path program 4 times [2020-10-09 14:20:47,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:20:47,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048037258] [2020-10-09 14:20:47,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-09 14:20:47,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:20:47,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:20:47,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:20:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:02,003 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:21:02,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:02,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:02,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:02,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:02,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:02,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:02,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:04,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:05,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:06,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:07,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:07,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:08,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:18,553 WARN L193 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:21:18,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:26,679 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:21:27,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:30,222 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-10-09 14:21:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:30,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048037258] [2020-10-09 14:21:30,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [155103919] [2020-10-09 14:21:30,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:21:30,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:21:30,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:21:30,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:32,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:32,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:32,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:32,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:32,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:32,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:32,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:32,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:46,179 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:21:46,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,879 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:21:55,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:55,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709732779] [2020-10-09 14:21:55,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:21:55,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:21:55,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:55,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-09 14:21:55,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:59,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:59,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:59,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:59,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:21:59,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:59,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:59,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:59,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:08,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:09,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:13,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:22:13,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 27 [2020-10-09 14:22:13,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900360850] [2020-10-09 14:22:13,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-09 14:22:13,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:22:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-09 14:22:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=527, Unknown=17, NotChecked=0, Total=702 [2020-10-09 14:22:38,028 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:22:38,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 2973 transitions, 46583 flow. Second operand 27 states. [2020-10-09 14:22:38,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:22:38,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:22:38,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:22:58,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (+ (* 3 c_~i~0) c_~j~0)) (.cse23 (* c_~i~0 (- 2))) (.cse24 (* c_~j~0 (- 1)))) (and (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse0 (* 2 v_prenex_2)) (.cse1 (* 2 v_prenex_1))) (let ((.cse2 (* 2 v_prenex_3)) (.cse3 (+ (* 2 v_prenex_4) .cse0 .cse1 c_~j~0))) (or (<= (+ .cse0 2) 0) (< 0 .cse0) (<= (+ .cse0 .cse1 2) .cse2) (<= .cse3 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse2 (+ .cse0 .cse1)) (< 373 .cse3))))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse5 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse6 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse7 (+ .cse5 .cse6 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse4 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse4 (+ .cse5 .cse6)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse6 2) 0) (< 371 .cse7) (<= .cse7 368) (< 0 .cse6) (< 1 v_~j~0_81) (<= (+ .cse5 .cse6 2) .cse4) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< aux_mod_v_~i~0_142_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse8 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse8 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse8 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse10 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse11 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse9 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse12 (+ .cse10 .cse11 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse9 (+ .cse10 .cse11)) (<= (+ .cse11 2) 0) (<= .cse12 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse11) (<= (+ .cse10 .cse11 2) .cse9) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_v_~i~0_133_51_78) (< 371 .cse12))))) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse14 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse15 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse13 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse16 (+ .cse14 .cse15 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse13 (+ .cse14 .cse15)) (<= (+ .cse15 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse16 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse15) (<= (+ .cse14 .cse15 2) .cse13) (< 371 .cse16))))) (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse17 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< (+ aux_div_v_~i~0_142_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (< 0 (+ .cse17 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (<= (+ .cse17 c_~j~0 3) 0)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse18 (* 2 v_prenex_2)) (.cse19 (* 2 v_prenex_1))) (let ((.cse20 (* 2 v_prenex_3)) (.cse21 (+ (* 2 v_prenex_4) .cse18 .cse19 c_~j~0))) (or (< (+ c_~i~0 (* 2 c_~j~0)) v_prenex_3) (<= (+ .cse18 2) 0) (< 0 .cse18) (<= (+ .cse18 .cse19 2) .cse20) (<= .cse21 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< .cse20 (+ .cse18 .cse19)) (< 373 .cse21))))) (< .cse22 (+ (div (+ .cse23 .cse24 373) 2) 3)) (< .cse22 (+ (div (+ .cse23 .cse24 371) 3) 3)))) is different from false [2020-10-09 14:23:00,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (+ (* 3 c_~i~0) c_~j~0)) (.cse23 (* c_~i~0 (- 2))) (.cse24 (* c_~j~0 (- 1)))) (and (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< aux_mod_v_~i~0_142_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse0 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse0 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse2 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse1 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse4 (+ .cse2 .cse3 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse1 (+ .cse2 .cse3)) (<= (+ .cse3 2) 0) (<= .cse4 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse3) (<= (+ .cse2 .cse3 2) .cse1) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_v_~i~0_133_51_78) (< 371 .cse4))))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse6 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse7 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse5 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse8 (+ .cse6 .cse7 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse5 (+ .cse6 .cse7)) (<= (+ .cse7 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse8 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse7) (<= (+ .cse6 .cse7 2) .cse5) (< 371 .cse8))))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse9 (* 2 v_prenex_2)) (.cse10 (* 2 v_prenex_1))) (let ((.cse11 (* 2 v_prenex_3)) (.cse12 (+ (* 2 v_prenex_4) .cse9 .cse10 c_~j~0))) (or (<= (+ .cse9 2) 0) (< 0 .cse9) (<= (+ .cse9 .cse10 2) .cse11) (<= .cse12 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse11 (+ .cse9 .cse10)) (< 373 .cse12))))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse14 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse15 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse16 (+ .cse14 .cse15 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse13 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse13 (+ .cse14 .cse15)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse15 2) 0) (< 371 .cse16) (<= .cse16 368) (< 0 .cse15) (< 1 v_~j~0_81) (<= (+ .cse14 .cse15 2) .cse13) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse17 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< (+ aux_div_v_~i~0_142_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (< 0 (+ .cse17 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (<= (+ .cse17 c_~j~0 3) 0)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse18 (* 2 v_prenex_2)) (.cse19 (* 2 v_prenex_1))) (let ((.cse20 (* 2 v_prenex_3)) (.cse21 (+ (* 2 v_prenex_4) .cse18 .cse19 c_~j~0))) (or (< (+ c_~i~0 (* 2 c_~j~0)) v_prenex_3) (<= (+ .cse18 2) 0) (< 0 .cse18) (<= (+ .cse18 .cse19 2) .cse20) (<= .cse21 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< .cse20 (+ .cse18 .cse19)) (< 373 .cse21))))) (< .cse22 (+ (div (+ .cse23 .cse24 373) 2) 3)) (< .cse22 (+ (div (+ .cse23 .cse24 371) 3) 3)) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))))) is different from false [2020-10-09 14:23:05,009 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 32 [2020-10-09 14:23:07,723 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2020-10-09 14:23:14,372 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 3 c_~i~0) c_~j~0)) (.cse5 (* c_~i~0 (- 2))) (.cse6 (* c_~j~0 (- 1)))) (and (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse3 (+ .cse1 .cse2 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse0 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse0 (+ .cse1 .cse2)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse2 2) 0) (< 371 .cse3) (<= .cse3 368) (< 0 .cse2) (< 1 v_~j~0_81) (<= (+ .cse1 .cse2 2) .cse0) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (< .cse4 (+ (div (+ .cse5 .cse6 373) 2) 3)) (< .cse4 (+ (div (+ .cse5 .cse6 371) 3) 3)) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))))) is different from false [2020-10-09 14:23:20,576 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 3 c_~i~0) c_~j~0)) (.cse5 (* c_~i~0 (- 2))) (.cse6 (* c_~j~0 (- 1)))) (and (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse3 (+ .cse1 .cse2 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse0 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse0 (+ .cse1 .cse2)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse2 2) 0) (< 371 .cse3) (<= .cse3 368) (< 0 .cse2) (< 1 v_~j~0_81) (<= (+ .cse1 .cse2 2) .cse0) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (<= c_~j~0 377) (< .cse4 (+ (div (+ .cse5 .cse6 373) 2) 3)) (< .cse4 (+ (div (+ .cse5 .cse6 371) 3) 3)) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))))) is different from false [2020-10-09 14:24:17,095 WARN L193 SmtUtils]: Spent 32.13 s on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2020-10-09 14:24:27,947 WARN L193 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2020-10-09 14:24:28,613 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 28 [2020-10-09 14:24:29,157 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 30 [2020-10-09 14:24:43,294 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse10 (* c_~i~0 (- 2))) (.cse11 (* c_~j~0 (- 1)))) (and (< (+ c_~i~0 c_~j~0) 378) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse0 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse0 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse2 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse1 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse4 (+ .cse2 .cse3 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse1 (+ .cse2 .cse3)) (<= (+ .cse3 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse4 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse3) (<= (+ .cse2 .cse3 2) .cse1) (< 371 .cse4))))) (< .cse5 378) (< (+ (* 2 c_~i~0) c_~j~0) 378) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse6 (* 2 v_prenex_2)) (.cse7 (* 2 v_prenex_1))) (let ((.cse8 (* 2 v_prenex_3)) (.cse9 (+ (* 2 v_prenex_4) .cse6 .cse7 c_~j~0))) (or (<= (+ .cse6 2) 0) (< 0 .cse6) (<= (+ .cse6 .cse7 2) .cse8) (<= .cse9 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse8 (+ .cse6 .cse7)) (< 373 .cse9))))) (= c_ULTIMATE.start_main_~condI~0 0) (<= c_~j~0 377) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (<= c_~i~0 377) (< .cse5 (+ (div (+ .cse10 .cse11 373) 2) 3)) (< .cse5 (+ (div (+ .cse10 .cse11 371) 3) 3)))) is different from false [2020-10-09 14:24:45,780 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (+ (* 3 c_~i~0) c_~j~0)) (.cse14 (* c_~i~0 (- 2))) (.cse15 (* c_~j~0 (- 1)))) (and (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse0 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse0 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse2 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse1 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse4 (+ .cse2 .cse3 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse1 (+ .cse2 .cse3)) (<= (+ .cse3 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse4 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse3) (<= (+ .cse2 .cse3 2) .cse1) (< 371 .cse4))))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse5 (* 2 v_prenex_2)) (.cse6 (* 2 v_prenex_1))) (let ((.cse7 (* 2 v_prenex_3)) (.cse8 (+ (* 2 v_prenex_4) .cse5 .cse6 c_~j~0))) (or (<= (+ .cse5 2) 0) (< 0 .cse5) (<= (+ .cse5 .cse6 2) .cse7) (<= .cse8 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse7 (+ .cse5 .cse6)) (< 373 .cse8))))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse10 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse11 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse12 (+ .cse10 .cse11 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse9 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse9 (+ .cse10 .cse11)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse11 2) 0) (< 371 .cse12) (<= .cse12 368) (< 0 .cse11) (< 1 v_~j~0_81) (<= (+ .cse10 .cse11 2) .cse9) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (< .cse13 (+ (div (+ .cse14 .cse15 373) 2) 3)) (< .cse13 (+ (div (+ .cse14 .cse15 371) 3) 3)) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))))) is different from false [2020-10-09 14:24:52,189 WARN L193 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-10-09 14:25:01,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (+ (* 3 c_~i~0) c_~j~0)) (.cse14 (* c_~i~0 (- 2))) (.cse15 (* c_~j~0 (- 1)))) (and (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse0 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse0 c_~j~0 3) 0)))) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse2 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse1 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse4 (+ .cse2 .cse3 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse1 (+ .cse2 .cse3)) (<= (+ .cse3 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse4 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse3) (<= (+ .cse2 .cse3 2) .cse1) (< 371 .cse4))))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse5 (* 2 v_prenex_2)) (.cse6 (* 2 v_prenex_1))) (let ((.cse7 (* 2 v_prenex_3)) (.cse8 (+ (* 2 v_prenex_4) .cse5 .cse6 c_~j~0))) (or (<= (+ .cse5 2) 0) (< 0 .cse5) (<= (+ .cse5 .cse6 2) .cse7) (<= .cse8 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse7 (+ .cse5 .cse6)) (< 373 .cse8))))) (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse10 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse11 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse12 (+ .cse10 .cse11 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse9 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse9 (+ .cse10 .cse11)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse11 2) 0) (< 371 .cse12) (<= .cse12 368) (< 0 .cse11) (< 1 v_~j~0_81) (<= (+ .cse10 .cse11 2) .cse9) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (< .cse13 (+ (div (+ .cse14 .cse15 373) 2) 3)) (< .cse13 (+ (div (+ .cse14 .cse15 371) 3) 3)) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= c_~i~0 (+ c_~j~0 v_~i~0_130)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))))) is different from false [2020-10-09 14:25:11,517 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-10-09 14:25:24,701 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~j~0 (- 1)))) (let ((.cse1 (* c_~i~0 (- 1))) (.cse3 (+ c_~i~0 c_~j~0)) (.cse4 (+ .cse2 377)) (.cse0 (+ (* 2 c_~i~0) c_~j~0)) (.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse10 (* c_~i~0 (- 2)))) (and (< .cse0 (+ (div (+ .cse1 .cse2 374) 3) 2)) (< .cse0 (+ (div (+ .cse1 .cse2 375) 2) 2)) (< .cse3 (+ (div .cse4 3) 1)) (< .cse3 378) (< .cse3 (+ (div .cse4 2) 1)) (< .cse5 378) (< .cse0 378) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (v_~j~0_81 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse7 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse8 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse9 (+ .cse7 .cse8 v_~j~0_81 (* 3 aux_div_v_~i~0_133_51))) (.cse6 (* 2 aux_div_aux_mod_v_~i~0_133_51_78))) (or (< .cse6 (+ .cse7 .cse8)) (< (+ c_~i~0 (* 2 v_~j~0_81)) aux_div_aux_mod_v_~i~0_133_51_78) (<= (+ .cse8 2) 0) (< 371 .cse9) (<= .cse9 368) (< 0 .cse8) (< 1 v_~j~0_81) (<= (+ .cse7 .cse8 2) .cse6) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) v_~j~0_81) (+ aux_div_v_~i~0_133_51 3)))))) (<= c_~j~0 377) (<= c_~i~0 377) (< .cse5 (+ (div (+ .cse10 .cse2 373) 2) 3)) (< .cse5 (+ (div (+ .cse10 .cse2 371) 3) 3))))) is different from false [2020-10-09 14:25:27,030 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~j~0 (- 1)))) (let ((.cse1 (+ .cse8 377)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse7 (* c_~i~0 (- 1))) (.cse0 (+ c_~i~0 c_~j~0)) (.cse18 (+ (* 3 c_~i~0) c_~j~0)) (.cse24 (* c_~i~0 (- 2)))) (and (< .cse0 (+ (div .cse1 3) 1)) (< .cse0 (+ (div .cse1 2) 1)) (< .cse2 378) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse3 (* 2 v_prenex_2)) (.cse4 (* 2 v_prenex_1))) (let ((.cse5 (* 2 v_prenex_3)) (.cse6 (+ (* 2 v_prenex_4) .cse3 .cse4 c_~j~0))) (or (<= (+ .cse3 2) 0) (< 0 .cse3) (<= (+ .cse3 .cse4 2) .cse5) (<= .cse6 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse5 (+ .cse3 .cse4)) (< 373 .cse6))))) (<= c_~i~0 1) (< .cse2 (+ (div (+ .cse7 .cse8 374) 3) 2)) (< .cse2 (+ (div (+ .cse7 .cse8 375) 2) 2)) (< .cse0 378) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< aux_mod_v_~i~0_142_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse9 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse9 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse9 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse11 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse12 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse13 (+ .cse11 .cse12 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse10 (+ .cse11 .cse12)) (<= (+ .cse12 2) 0) (<= .cse13 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse12) (<= (+ .cse11 .cse12 2) .cse10) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_v_~i~0_133_51_78) (< 371 .cse13))))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse15 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse16 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse14 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse17 (+ .cse15 .cse16 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse14 (+ .cse15 .cse16)) (<= (+ .cse16 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse17 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse16) (<= (+ .cse15 .cse16 2) .cse14) (< 371 .cse17))))) (< .cse18 378) (<= c_~j~0 377) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse19 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< (+ aux_div_v_~i~0_142_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (< 0 (+ .cse19 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (<= (+ .cse19 c_~j~0 3) 0)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse20 (* 2 v_prenex_2)) (.cse21 (* 2 v_prenex_1))) (let ((.cse22 (* 2 v_prenex_3)) (.cse23 (+ (* 2 v_prenex_4) .cse20 .cse21 c_~j~0))) (or (< (+ c_~i~0 (* 2 c_~j~0)) v_prenex_3) (<= (+ .cse20 2) 0) (< 0 .cse20) (<= (+ .cse20 .cse21 2) .cse22) (<= .cse23 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< .cse22 (+ .cse20 .cse21)) (< 373 .cse23))))) (<= c_~i~0 377) (< .cse18 (+ (div (+ .cse24 .cse8 373) 2) 3)) (< .cse18 (+ (div (+ .cse24 .cse8 371) 3) 3))))) is different from false [2020-10-09 14:25:30,060 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2020-10-09 14:25:35,312 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2020-10-09 14:25:37,800 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2020-10-09 14:27:07,705 WARN L193 SmtUtils]: Spent 24.40 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-10-09 14:27:10,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~j~0 (- 1)))) (let ((.cse1 (+ .cse8 377)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse7 (* c_~i~0 (- 1))) (.cse0 (+ c_~i~0 c_~j~0)) (.cse18 (+ (* 3 c_~i~0) c_~j~0)) (.cse24 (* c_~i~0 (- 2)))) (and (< .cse0 (+ (div .cse1 3) 1)) (< .cse0 (+ (div .cse1 2) 1)) (< .cse2 378) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse3 (* 2 v_prenex_2)) (.cse4 (* 2 v_prenex_1))) (let ((.cse5 (* 2 v_prenex_3)) (.cse6 (+ (* 2 v_prenex_4) .cse3 .cse4 c_~j~0))) (or (<= (+ .cse3 2) 0) (< 0 .cse3) (<= (+ .cse3 .cse4 2) .cse5) (<= .cse6 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< (+ c_~i~0 c_~j~0) v_prenex_3) (< .cse5 (+ .cse3 .cse4)) (< 373 .cse6))))) (<= c_~i~0 1) (< .cse2 (+ (div (+ .cse7 .cse8 374) 3) 2)) (< .cse2 (+ (div (+ .cse7 .cse8 375) 2) 2)) (< .cse0 378) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< aux_mod_v_~i~0_142_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse9 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< 0 (+ .cse9 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (< (+ aux_div_v_~i~0_142_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (<= (+ .cse9 c_~j~0 3) 0)))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse11 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse12 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse13 (+ .cse11 .cse12 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse10 (+ .cse11 .cse12)) (<= (+ .cse12 2) 0) (<= .cse13 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse12) (<= (+ .cse11 .cse12 2) .cse10) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_v_~i~0_133_51_78) (< 371 .cse13))))) (exists ((aux_mod_v_~i~0_129_38 Int) (v_~i~0_130 Int) (aux_div_v_~i~0_129_38 Int)) (and (< aux_mod_v_~i~0_129_38 2) (<= 0 aux_mod_v_~i~0_129_38) (<= (+ (* 2 aux_mod_v_~i~0_129_38) c_~j~0) (+ (* 2 v_~i~0_130) (* 4 aux_div_v_~i~0_129_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_129_38) v_~i~0_130) (+ (* 6 aux_div_v_~i~0_129_38) 4)) (<= aux_div_v_~i~0_129_38 1))) (forall ((aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_133_51_78 Int) (aux_div_v_~i~0_133_51 Int)) (let ((.cse15 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91)) (.cse16 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_133_51_78_91_55))) (let ((.cse14 (* 2 aux_div_aux_mod_v_~i~0_133_51_78)) (.cse17 (+ .cse15 .cse16 c_~j~0 (* 3 aux_div_v_~i~0_133_51)))) (or (< .cse14 (+ .cse15 .cse16)) (<= (+ .cse16 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~i~0_133_51_78) (<= .cse17 368) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~i~0_133_51_78_91) c_~j~0) (+ aux_div_v_~i~0_133_51 3)) (< 0 .cse16) (<= (+ .cse15 .cse16 2) .cse14) (< 371 .cse17))))) (< .cse18 378) (= c_ULTIMATE.start_main_~condI~0 0) (<= c_~j~0 377) (forall ((aux_div_aux_div_v_~i~0_142_51_66 Int) (aux_mod_v_~i~0_142_51 Int)) (or (<= 3 aux_mod_v_~i~0_142_51) (< aux_mod_v_~i~0_142_51 0) (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_142_51_66) aux_mod_v_~i~0_142_51 187)) (< (+ (* 11 aux_div_aux_div_v_~i~0_142_51_66) (* 5 c_~j~0) (* 4 aux_mod_v_~i~0_142_51) 559) 0))) (forall ((aux_div_v_~i~0_142_51 Int) (aux_div_aux_mod_v_~i~0_142_51_44 Int)) (let ((.cse19 (* 2 aux_div_aux_mod_v_~i~0_142_51_44))) (or (< (+ aux_div_v_~i~0_142_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_142_51_44 187)) (< 0 (+ .cse19 c_~j~0 1)) (< (+ (* 3 aux_div_aux_mod_v_~i~0_142_51_44) c_~j~0 558) (* 4 aux_div_v_~i~0_142_51)) (<= (+ .cse19 c_~j~0 3) 0)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse20 (* 2 v_prenex_2)) (.cse21 (* 2 v_prenex_1))) (let ((.cse22 (* 2 v_prenex_3)) (.cse23 (+ (* 2 v_prenex_4) .cse20 .cse21 c_~j~0))) (or (< (+ c_~i~0 (* 2 c_~j~0)) v_prenex_3) (<= (+ .cse20 2) 0) (< 0 .cse20) (<= (+ .cse20 .cse21 2) .cse22) (<= .cse23 371) (< (+ (* 3 v_prenex_1) c_~j~0) (+ v_prenex_4 3)) (< .cse22 (+ .cse20 .cse21)) (< 373 .cse23))))) (<= c_~i~0 377) (< .cse18 (+ (div (+ .cse24 .cse8 373) 2) 3)) (< .cse18 (+ (div (+ .cse24 .cse8 371) 3) 3))))) is different from false [2020-10-09 14:27:18,041 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2020-10-09 14:27:22,140 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2020-10-09 14:27:33,349 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-10-09 14:27:41,650 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-10-09 14:27:44,186 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-10-09 14:27:46,636 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-10-09 14:27:49,908 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-10-09 14:29:54,940 WARN L193 SmtUtils]: Spent 30.41 s on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2020-10-09 14:30:06,394 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2020-10-09 14:30:12,337 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2020-10-09 14:30:29,450 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2020-10-09 14:30:36,827 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 Received shutdown request... [2020-10-09 14:30:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2020-10-09 14:30:53,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:30:53,210 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 14:30:53,220 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 14:30:53,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:30:53 BasicIcfg [2020-10-09 14:30:53,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:30:53,223 INFO L168 Benchmark]: Toolchain (without parser) took 871560.91 ms. Allocated memory was 253.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 208.3 MB in the beginning and 384.7 MB in the end (delta: -176.5 MB). Peak memory consumption was 972.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:53,224 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:30:53,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.77 ms. Allocated memory was 253.2 MB in the beginning and 321.9 MB in the end (delta: 68.7 MB). Free memory was 208.3 MB in the beginning and 277.3 MB in the end (delta: -69.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:53,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.70 ms. Allocated memory is still 321.9 MB. Free memory is still 277.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:30:53,226 INFO L168 Benchmark]: Boogie Preprocessor took 25.43 ms. Allocated memory is still 321.9 MB. Free memory was 277.3 MB in the beginning and 274.8 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:30:53,226 INFO L168 Benchmark]: RCFGBuilder took 396.36 ms. Allocated memory is still 321.9 MB. Free memory was 274.8 MB in the beginning and 252.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:53,227 INFO L168 Benchmark]: TraceAbstraction took 870382.88 ms. Allocated memory was 321.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 252.7 MB in the beginning and 384.7 MB in the end (delta: -132.0 MB). Peak memory consumption was 948.6 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:53,239 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.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 689.77 ms. Allocated memory was 253.2 MB in the beginning and 321.9 MB in the end (delta: 68.7 MB). Free memory was 208.3 MB in the beginning and 277.3 MB in the end (delta: -69.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 60.70 ms. Allocated memory is still 321.9 MB. Free memory is still 277.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * Boogie Preprocessor took 25.43 ms. Allocated memory is still 321.9 MB. Free memory was 277.3 MB in the beginning and 274.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 396.36 ms. Allocated memory is still 321.9 MB. Free memory was 274.8 MB in the beginning and 252.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 870382.88 ms. Allocated memory was 321.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 252.7 MB in the beginning and 384.7 MB in the end (delta: -132.0 MB). Peak memory consumption was 948.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 711]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 711). Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 870.2s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 759.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 SDtfs, 829 SDslu, 474 SDs, 0 SdLazy, 3270 SolverSat, 1197 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 131.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2290 GetRequests, 1640 SyntacticMatches, 19 SemanticMatches, 630 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 21288 ImplicationChecksByTransitivity, 678.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46583occurred in iteration=7, 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, 105.3s InterpolantComputationTime, 911 NumberOfCodeBlocks, 911 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1786 ConstructedInterpolants, 228 QuantifiedInterpolants, 1785619 SizeOfPredicates, 73 NumberOfNonLiveVariables, 2078 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 0/966 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown