/usr/bin/java -Xmx8000000000 -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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:02:52,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:02:52,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:02:52,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:02:52,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:02:52,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:02:52,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:02:52,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:02:52,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:02:52,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:02:52,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:02:52,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:02:52,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:02:52,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:02:52,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:02:52,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:02:52,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:02:52,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:02:52,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:02:52,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:02:52,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:02:52,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:02:52,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:02:52,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:02:52,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:02:52,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:02:52,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:02:52,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:02:52,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:02:52,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:02:52,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:02:52,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:02:52,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:02:52,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:02:52,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:02:52,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:02:52,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:02:52,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:02:52,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:02:52,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:02:52,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:02:52,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:02:52,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:02:52,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:02:52,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:02:52,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:02:52,600 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:02:52,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:02:52,601 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:02:52,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:02:52,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:02:52,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:02:52,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:02:52,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:02:52,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:02:52,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:02:52,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:02:52,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:02:52,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:02:52,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:02:52,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:02:52,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:02:52,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:02:52,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:02:52,606 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:02:52,606 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:02:52,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:02:52,606 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:02:52,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:02:52,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:02:52,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:02:52,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:02:52,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:02:52,908 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:02:52,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_rmo.opt.i [2019-12-27 23:02:52,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a6b7026/b6c73d34986342c68e4a2681128eb5fb/FLAG805d50d96 [2019-12-27 23:02:53,477 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:02:53,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_rmo.opt.i [2019-12-27 23:02:53,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a6b7026/b6c73d34986342c68e4a2681128eb5fb/FLAG805d50d96 [2019-12-27 23:02:53,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a6b7026/b6c73d34986342c68e4a2681128eb5fb [2019-12-27 23:02:53,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:02:53,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:02:53,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:02:53,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:02:53,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:02:53,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:02:53" (1/1) ... [2019-12-27 23:02:53,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bf895c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:53, skipping insertion in model container [2019-12-27 23:02:53,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:02:53" (1/1) ... [2019-12-27 23:02:53,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:02:53,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:02:54,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:02:54,375 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:02:54,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:02:54,498 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:02:54,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54 WrapperNode [2019-12-27 23:02:54,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:02:54,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:02:54,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:02:54,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:02:54,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:02:54,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:02:54,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:02:54,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:02:54,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (1/1) ... [2019-12-27 23:02:54,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:02:54,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:02:54,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:02:54,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:02:54,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (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 [2019-12-27 23:02:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:02:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:02:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:02:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:02:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:02:54,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:02:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:02:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:02:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 23:02:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 23:02:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:02:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:02:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:02:54,673 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:02:55,022 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:02:55,023 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:02:55,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:02:55 BoogieIcfgContainer [2019-12-27 23:02:55,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:02:55,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:02:55,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:02:55,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:02:55,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:02:53" (1/3) ... [2019-12-27 23:02:55,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d7e795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:02:55, skipping insertion in model container [2019-12-27 23:02:55,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:02:54" (2/3) ... [2019-12-27 23:02:55,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d7e795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:02:55, skipping insertion in model container [2019-12-27 23:02:55,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:02:55" (3/3) ... [2019-12-27 23:02:55,033 INFO L109 eAbstractionObserver]: Analyzing ICFG safe035_rmo.opt.i [2019-12-27 23:02:55,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:02:55,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:02:55,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:02:55,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:02:55,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:02:55,119 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 23:02:55,140 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:02:55,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:02:55,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:02:55,141 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:02:55,141 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:02:55,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:02:55,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:02:55,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:02:55,156 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 54 transitions [2019-12-27 23:02:55,158 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions [2019-12-27 23:02:55,205 INFO L132 PetriNetUnfolder]: 1/51 cut-off events. [2019-12-27 23:02:55,205 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:02:55,212 INFO L76 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 1/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2019-12-27 23:02:55,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions [2019-12-27 23:02:55,234 INFO L132 PetriNetUnfolder]: 1/51 cut-off events. [2019-12-27 23:02:55,234 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:02:55,235 INFO L76 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 1/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2019-12-27 23:02:55,238 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 450 [2019-12-27 23:02:55,239 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:02:56,688 INFO L206 etLargeBlockEncoding]: Checked pairs total: 429 [2019-12-27 23:02:56,689 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 23:02:56,692 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 15 transitions [2019-12-27 23:02:56,703 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 46 states. [2019-12-27 23:02:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-12-27 23:02:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 23:02:56,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:56,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:56,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1861325362, now seen corresponding path program 1 times [2019-12-27 23:02:56,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:56,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131782392] [2019-12-27 23:02:56,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131782392] [2019-12-27 23:02:57,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:02:57,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751125865] [2019-12-27 23:02:57,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 23:02:57,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:57,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:02:57,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:02:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,052 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-12-27 23:02:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,088 INFO L93 Difference]: Finished difference Result 44 states and 89 transitions. [2019-12-27 23:02:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:02:57,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 23:02:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,119 INFO L225 Difference]: With dead ends: 44 [2019-12-27 23:02:57,119 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 23:02:57,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 23:02:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 23:02:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 23:02:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2019-12-27 23:02:57,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 8 [2019-12-27 23:02:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,175 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 69 transitions. [2019-12-27 23:02:57,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:02:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 69 transitions. [2019-12-27 23:02:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:02:57,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1727732260, now seen corresponding path program 1 times [2019-12-27 23:02:57,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771866084] [2019-12-27 23:02:57,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771866084] [2019-12-27 23:02:57,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:02:57,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889986280] [2019-12-27 23:02:57,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 17 transitions. [2019-12-27 23:02:57,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:57,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:02:57,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:02:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,312 INFO L87 Difference]: Start difference. First operand 36 states and 69 transitions. Second operand 3 states. [2019-12-27 23:02:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,321 INFO L93 Difference]: Finished difference Result 34 states and 64 transitions. [2019-12-27 23:02:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:02:57,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 23:02:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,324 INFO L225 Difference]: With dead ends: 34 [2019-12-27 23:02:57,324 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 23:02:57,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 23:02:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 23:02:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 23:02:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2019-12-27 23:02:57,330 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 9 [2019-12-27 23:02:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 64 transitions. [2019-12-27 23:02:57,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:02:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 64 transitions. [2019-12-27 23:02:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:02:57,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,332 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1866511351, now seen corresponding path program 1 times [2019-12-27 23:02:57,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334593726] [2019-12-27 23:02:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334593726] [2019-12-27 23:02:57,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:02:57,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055036711] [2019-12-27 23:02:57,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:02:57,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:57,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:02:57,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:02:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,394 INFO L87 Difference]: Start difference. First operand 34 states and 64 transitions. Second operand 3 states. [2019-12-27 23:02:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,415 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2019-12-27 23:02:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:02:57,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 23:02:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,416 INFO L225 Difference]: With dead ends: 36 [2019-12-27 23:02:57,416 INFO L226 Difference]: Without dead ends: 22 [2019-12-27 23:02:57,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:02:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-27 23:02:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-27 23:02:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 23:02:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2019-12-27 23:02:57,420 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 9 [2019-12-27 23:02:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,421 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-12-27 23:02:57,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:02:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2019-12-27 23:02:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:02:57,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2027276793, now seen corresponding path program 1 times [2019-12-27 23:02:57,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533910154] [2019-12-27 23:02:57,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533910154] [2019-12-27 23:02:57,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:02:57,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246776998] [2019-12-27 23:02:57,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 23:02:57,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:57,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:02:57,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:02:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:02:57,597 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 5 states. [2019-12-27 23:02:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,639 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2019-12-27 23:02:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:02:57,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 23:02:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,641 INFO L225 Difference]: With dead ends: 25 [2019-12-27 23:02:57,641 INFO L226 Difference]: Without dead ends: 19 [2019-12-27 23:02:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:02:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-27 23:02:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-27 23:02:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-27 23:02:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-12-27 23:02:57,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2019-12-27 23:02:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,645 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-12-27 23:02:57,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:02:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-12-27 23:02:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:02:57,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,646 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2029948683, now seen corresponding path program 2 times [2019-12-27 23:02:57,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837493415] [2019-12-27 23:02:57,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837493415] [2019-12-27 23:02:57,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:02:57,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557449390] [2019-12-27 23:02:57,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 23:02:57,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:57,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:02:57,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:02:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:02:57,749 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 6 states. [2019-12-27 23:02:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,825 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-12-27 23:02:57,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:02:57,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 23:02:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,826 INFO L225 Difference]: With dead ends: 19 [2019-12-27 23:02:57,826 INFO L226 Difference]: Without dead ends: 16 [2019-12-27 23:02:57,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:02:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-27 23:02:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-27 23:02:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-27 23:02:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-12-27 23:02:57,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2019-12-27 23:02:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,829 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-12-27 23:02:57,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:02:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-12-27 23:02:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 23:02:57,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1498585343, now seen corresponding path program 1 times [2019-12-27 23:02:57,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730449647] [2019-12-27 23:02:57,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730449647] [2019-12-27 23:02:57,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:02:57,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054668224] [2019-12-27 23:02:57,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:57,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 15 transitions. [2019-12-27 23:02:57,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:57,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:02:57,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:02:57,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:02:57,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:02:57,923 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 5 states. [2019-12-27 23:02:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:57,947 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-12-27 23:02:57,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:02:57,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 23:02:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:57,948 INFO L225 Difference]: With dead ends: 18 [2019-12-27 23:02:57,948 INFO L226 Difference]: Without dead ends: 12 [2019-12-27 23:02:57,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:02:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-27 23:02:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-27 23:02:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-27 23:02:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2019-12-27 23:02:57,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2019-12-27 23:02:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:57,951 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2019-12-27 23:02:57,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:02:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2019-12-27 23:02:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 23:02:57,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:02:57,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:02:57,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:02:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:02:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1496019473, now seen corresponding path program 2 times [2019-12-27 23:02:57,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:02:57,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957614050] [2019-12-27 23:02:57,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:02:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:02:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:02:57,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957614050] [2019-12-27 23:02:57,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:02:57,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:02:57,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830949253] [2019-12-27 23:02:57,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:02:57,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:02:58,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 23:02:58,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:02:58,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:02:58,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:02:58,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:02:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:02:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:02:58,002 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 4 states. [2019-12-27 23:02:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:02:58,014 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2019-12-27 23:02:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:02:58,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 23:02:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:02:58,015 INFO L225 Difference]: With dead ends: 11 [2019-12-27 23:02:58,015 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 23:02:58,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:02:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 23:02:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 23:02:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 23:02:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 23:02:58,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-12-27 23:02:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:02:58,017 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 23:02:58,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:02:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 23:02:58,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 23:02:58,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:02:58 BasicIcfg [2019-12-27 23:02:58,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:02:58,024 INFO L168 Benchmark]: Toolchain (without parser) took 4197.82 ms. Allocated memory was 137.9 MB in the beginning and 247.5 MB in the end (delta: 109.6 MB). Free memory was 100.7 MB in the beginning and 110.9 MB in the end (delta: -10.1 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,025 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.91 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 159.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.78 ms. Allocated memory is still 202.4 MB. Free memory was 159.4 MB in the beginning and 157.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,028 INFO L168 Benchmark]: Boogie Preprocessor took 40.01 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 156.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,029 INFO L168 Benchmark]: RCFGBuilder took 424.12 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 135.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,030 INFO L168 Benchmark]: TraceAbstraction took 2995.69 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 135.3 MB in the beginning and 110.9 MB in the end (delta: 24.5 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:02:58,034 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.91 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 159.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.78 ms. Allocated memory is still 202.4 MB. Free memory was 159.4 MB in the beginning and 157.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.01 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 156.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.12 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 135.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2995.69 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 135.3 MB in the beginning and 110.9 MB in the end (delta: 24.5 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 63 ProgramPointsBefore, 21 ProgramPointsAfterwards, 54 TransitionsBefore, 15 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 7 FixpointIterations, 14 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 223 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 429 CheckedPairsTotal, 46 TotalNumberOfCompositions - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 71 SDtfs, 36 SDslu, 50 SDs, 0 SdLazy, 61 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...