./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/20_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/20_lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4bd0a104431602f65d67040bef1f743648c257ee .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:58:05,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:58:05,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:58:05,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:58:05,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:58:05,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:58:05,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:58:05,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:58:05,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:58:05,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:58:05,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:58:05,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:58:05,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:58:05,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:58:05,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:58:05,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:58:05,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:58:05,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:58:05,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:58:05,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:58:05,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:58:05,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:58:05,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:58:05,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:58:05,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:58:05,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:58:05,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:58:05,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:58:05,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:58:05,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:58:05,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:58:05,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:58:05,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:58:05,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:58:05,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:58:05,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:58:05,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:58:05,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:58:05,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:58:05,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:58:05,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:58:05,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:58:05,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:58:05,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:58:05,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:58:05,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:58:05,613 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:58:05,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:58:05,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:58:05,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:58:05,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:58:05,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:58:05,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:58:05,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:58:05,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:58:05,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:58:05,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:58:05,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:58:05,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:58:05,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:58:05,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:58:05,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:58:05,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:58:05,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:58:05,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:58:05,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:58:05,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:58:05,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:58:05,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:58:05,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:58:05,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:58:05,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4bd0a104431602f65d67040bef1f743648c257ee [2019-11-28 17:58:05,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:58:05,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:58:05,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:58:05,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:58:05,957 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:58:05,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/20_lamport.i [2019-11-28 17:58:06,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf19891/b3098961b56d42cb959dfddc548db217/FLAG16da61b55 [2019-11-28 17:58:06,571 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:58:06,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/20_lamport.i [2019-11-28 17:58:06,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf19891/b3098961b56d42cb959dfddc548db217/FLAG16da61b55 [2019-11-28 17:58:06,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf19891/b3098961b56d42cb959dfddc548db217 [2019-11-28 17:58:06,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:58:06,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:58:06,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:58:06,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:58:06,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:58:06,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:58:06" (1/1) ... [2019-11-28 17:58:06,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8115ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:06, skipping insertion in model container [2019-11-28 17:58:06,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:58:06" (1/1) ... [2019-11-28 17:58:06,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:58:06,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:58:07,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:58:07,412 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:58:07,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:58:07,556 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:58:07,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07 WrapperNode [2019-11-28 17:58:07,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:58:07,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:58:07,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:58:07,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:58:07,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:58:07,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:58:07,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:58:07,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:58:07,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (1/1) ... [2019-11-28 17:58:07,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:58:07,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:58:07,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:58:07,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:58:07,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (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-11-28 17:58:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-28 17:58:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-28 17:58:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:58:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:58:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:58:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:58:07,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:58:07,704 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 17:58:08,091 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:58:08,092 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 17:58:08,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:58:08 BoogieIcfgContainer [2019-11-28 17:58:08,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:58:08,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:58:08,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:58:08,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:58:08,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:58:06" (1/3) ... [2019-11-28 17:58:08,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44229849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:58:08, skipping insertion in model container [2019-11-28 17:58:08,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:58:07" (2/3) ... [2019-11-28 17:58:08,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44229849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:58:08, skipping insertion in model container [2019-11-28 17:58:08,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:58:08" (3/3) ... [2019-11-28 17:58:08,101 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-11-28 17:58:08,109 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:58:08,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:58:08,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:58:08,117 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:58:08,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,144 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:58:08,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 17:58:08,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:58:08,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:58:08,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:58:08,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:58:08,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:58:08,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:58:08,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:58:08,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:58:08,219 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-11-28 17:58:08,222 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-11-28 17:58:08,284 INFO L134 PetriNetUnfolder]: 24/91 cut-off events. [2019-11-28 17:58:08,285 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:58:08,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-11-28 17:58:08,300 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-11-28 17:58:08,325 INFO L134 PetriNetUnfolder]: 24/91 cut-off events. [2019-11-28 17:58:08,325 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:58:08,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-11-28 17:58:08,334 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-11-28 17:58:08,335 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:58:09,713 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7520 [2019-11-28 17:58:09,714 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-11-28 17:58:09,717 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 51 transitions [2019-11-28 17:58:09,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 291 states. [2019-11-28 17:58:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states. [2019-11-28 17:58:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 17:58:09,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:09,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 17:58:09,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash 12384667, now seen corresponding path program 1 times [2019-11-28 17:58:09,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:09,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266589670] [2019-11-28 17:58:09,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:09,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266589670] [2019-11-28 17:58:09,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:09,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:58:09,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481687417] [2019-11-28 17:58:09,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:58:09,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:09,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:58:09,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:58:09,966 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 2 states. [2019-11-28 17:58:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,009 INFO L93 Difference]: Finished difference Result 291 states and 750 transitions. [2019-11-28 17:58:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:58:10,011 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-28 17:58:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,055 INFO L225 Difference]: With dead ends: 291 [2019-11-28 17:58:10,055 INFO L226 Difference]: Without dead ends: 282 [2019-11-28 17:58:10,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:58:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-28 17:58:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-11-28 17:58:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-28 17:58:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 732 transitions. [2019-11-28 17:58:10,157 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 732 transitions. Word has length 4 [2019-11-28 17:58:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,158 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 732 transitions. [2019-11-28 17:58:10,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:58:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 732 transitions. [2019-11-28 17:58:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:58:10,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,161 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash 27980612, now seen corresponding path program 1 times [2019-11-28 17:58:10,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177639178] [2019-11-28 17:58:10,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177639178] [2019-11-28 17:58:10,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:58:10,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86753407] [2019-11-28 17:58:10,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,256 INFO L87 Difference]: Start difference. First operand 282 states and 732 transitions. Second operand 3 states. [2019-11-28 17:58:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,317 INFO L93 Difference]: Finished difference Result 281 states and 714 transitions. [2019-11-28 17:58:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 17:58:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,320 INFO L225 Difference]: With dead ends: 281 [2019-11-28 17:58:10,321 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 17:58:10,322 INFO L630 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-11-28 17:58:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 17:58:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-11-28 17:58:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 17:58:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 615 transitions. [2019-11-28 17:58:10,363 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 615 transitions. Word has length 9 [2019-11-28 17:58:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,364 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 615 transitions. [2019-11-28 17:58:10,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 615 transitions. [2019-11-28 17:58:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:58:10,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,368 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1037274544, now seen corresponding path program 1 times [2019-11-28 17:58:10,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859809726] [2019-11-28 17:58:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859809726] [2019-11-28 17:58:10,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:58:10,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809266192] [2019-11-28 17:58:10,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,452 INFO L87 Difference]: Start difference. First operand 236 states and 615 transitions. Second operand 3 states. [2019-11-28 17:58:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,473 INFO L93 Difference]: Finished difference Result 225 states and 582 transitions. [2019-11-28 17:58:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 17:58:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,475 INFO L225 Difference]: With dead ends: 225 [2019-11-28 17:58:10,476 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 17:58:10,476 INFO L630 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-11-28 17:58:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 17:58:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-28 17:58:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 17:58:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 490 transitions. [2019-11-28 17:58:10,486 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 490 transitions. Word has length 9 [2019-11-28 17:58:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,487 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 490 transitions. [2019-11-28 17:58:10,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 490 transitions. [2019-11-28 17:58:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:58:10,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,490 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1540220195, now seen corresponding path program 1 times [2019-11-28 17:58:10,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475360254] [2019-11-28 17:58:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475360254] [2019-11-28 17:58:10,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:10,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359516412] [2019-11-28 17:58:10,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,577 INFO L87 Difference]: Start difference. First operand 186 states and 490 transitions. Second operand 3 states. [2019-11-28 17:58:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,613 INFO L93 Difference]: Finished difference Result 308 states and 768 transitions. [2019-11-28 17:58:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:58:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,619 INFO L225 Difference]: With dead ends: 308 [2019-11-28 17:58:10,619 INFO L226 Difference]: Without dead ends: 306 [2019-11-28 17:58:10,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-28 17:58:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 229. [2019-11-28 17:58:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-28 17:58:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 602 transitions. [2019-11-28 17:58:10,645 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 602 transitions. Word has length 15 [2019-11-28 17:58:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 602 transitions. [2019-11-28 17:58:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 602 transitions. [2019-11-28 17:58:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:58:10,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,650 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash 988190489, now seen corresponding path program 1 times [2019-11-28 17:58:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315505053] [2019-11-28 17:58:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315505053] [2019-11-28 17:58:10,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:10,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961632110] [2019-11-28 17:58:10,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,686 INFO L87 Difference]: Start difference. First operand 229 states and 602 transitions. Second operand 3 states. [2019-11-28 17:58:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,753 INFO L93 Difference]: Finished difference Result 312 states and 770 transitions. [2019-11-28 17:58:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:58:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,757 INFO L225 Difference]: With dead ends: 312 [2019-11-28 17:58:10,757 INFO L226 Difference]: Without dead ends: 237 [2019-11-28 17:58:10,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-28 17:58:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2019-11-28 17:58:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 17:58:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 534 transitions. [2019-11-28 17:58:10,768 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 534 transitions. Word has length 15 [2019-11-28 17:58:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,769 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 534 transitions. [2019-11-28 17:58:10,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 534 transitions. [2019-11-28 17:58:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:58:10,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,772 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash -795157281, now seen corresponding path program 2 times [2019-11-28 17:58:10,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628553041] [2019-11-28 17:58:10,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628553041] [2019-11-28 17:58:10,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:10,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325597572] [2019-11-28 17:58:10,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,818 INFO L87 Difference]: Start difference. First operand 216 states and 534 transitions. Second operand 3 states. [2019-11-28 17:58:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,845 INFO L93 Difference]: Finished difference Result 293 states and 674 transitions. [2019-11-28 17:58:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:58:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,848 INFO L225 Difference]: With dead ends: 293 [2019-11-28 17:58:10,848 INFO L226 Difference]: Without dead ends: 293 [2019-11-28 17:58:10,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-28 17:58:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 216. [2019-11-28 17:58:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 17:58:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 522 transitions. [2019-11-28 17:58:10,858 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 522 transitions. Word has length 15 [2019-11-28 17:58:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 522 transitions. [2019-11-28 17:58:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 522 transitions. [2019-11-28 17:58:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:58:10,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1884700835, now seen corresponding path program 2 times [2019-11-28 17:58:10,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436767365] [2019-11-28 17:58:10,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:10,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436767365] [2019-11-28 17:58:10,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:10,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:10,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645634799] [2019-11-28 17:58:10,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:10,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:10,896 INFO L87 Difference]: Start difference. First operand 216 states and 522 transitions. Second operand 3 states. [2019-11-28 17:58:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:10,945 INFO L93 Difference]: Finished difference Result 181 states and 375 transitions. [2019-11-28 17:58:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:10,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:58:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:10,948 INFO L225 Difference]: With dead ends: 181 [2019-11-28 17:58:10,948 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:58:10,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:58:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-11-28 17:58:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 17:58:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 190 transitions. [2019-11-28 17:58:10,956 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 190 transitions. Word has length 15 [2019-11-28 17:58:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:10,957 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 190 transitions. [2019-11-28 17:58:10,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 190 transitions. [2019-11-28 17:58:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:58:10,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:10,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:10,958 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:10,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1567500834, now seen corresponding path program 1 times [2019-11-28 17:58:10,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:10,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016568538] [2019-11-28 17:58:10,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:11,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016568538] [2019-11-28 17:58:11,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:11,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:11,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419188110] [2019-11-28 17:58:11,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:11,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:11,025 INFO L87 Difference]: Start difference. First operand 96 states and 190 transitions. Second operand 3 states. [2019-11-28 17:58:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:11,040 INFO L93 Difference]: Finished difference Result 98 states and 191 transitions. [2019-11-28 17:58:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:11,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:58:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:11,041 INFO L225 Difference]: With dead ends: 98 [2019-11-28 17:58:11,041 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 17:58:11,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 17:58:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-28 17:58:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 17:58:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 159 transitions. [2019-11-28 17:58:11,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 159 transitions. Word has length 17 [2019-11-28 17:58:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:11,046 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 159 transitions. [2019-11-28 17:58:11,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2019-11-28 17:58:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:58:11,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:58:11,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:58:11,047 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:58:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:58:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 322655978, now seen corresponding path program 1 times [2019-11-28 17:58:11,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:58:11,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496298340] [2019-11-28 17:58:11,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:58:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:58:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:58:11,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496298340] [2019-11-28 17:58:11,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:58:11,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:58:11,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222993787] [2019-11-28 17:58:11,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:58:11,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:58:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:58:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:58:11,078 INFO L87 Difference]: Start difference. First operand 81 states and 159 transitions. Second operand 3 states. [2019-11-28 17:58:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:58:11,084 INFO L93 Difference]: Finished difference Result 56 states and 119 transitions. [2019-11-28 17:58:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:58:11,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:58:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:58:11,085 INFO L225 Difference]: With dead ends: 56 [2019-11-28 17:58:11,085 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:58:11,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 17:58:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:58:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:58:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:58:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:58:11,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 17:58:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:58:11,087 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:58:11,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:58:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:58:11,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:58:11,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:58:11 BasicIcfg [2019-11-28 17:58:11,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:58:11,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:58:11,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:58:11,094 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:58:11,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:58:08" (3/4) ... [2019-11-28 17:58:11,098 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:58:11,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-28 17:58:11,112 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 17:58:11,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:58:11,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 17:58:11,160 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:58:11,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:58:11,164 INFO L168 Benchmark]: Toolchain (without parser) took 4338.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.7 MB in the beginning and 798.0 MB in the end (delta: 159.7 MB). Peak memory consumption was 287.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,164 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:58:11,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,166 INFO L168 Benchmark]: Boogie Preprocessor took 32.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:58:11,167 INFO L168 Benchmark]: RCFGBuilder took 451.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,168 INFO L168 Benchmark]: TraceAbstraction took 2998.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 804.6 MB in the end (delta: 253.9 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,168 INFO L168 Benchmark]: Witness Printer took 67.64 ms. Allocated memory is still 1.2 GB. Free memory was 804.6 MB in the beginning and 798.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:58:11,172 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 732.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 451.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2998.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 804.6 MB in the end (delta: 253.9 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. * Witness Printer took 67.64 ms. Allocated memory is still 1.2 GB. Free memory was 804.6 MB in the beginning and 798.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 72 ProgramPointsBefore, 37 ProgramPointsAfterwards, 92 TransitionsBefore, 51 TransitionsAfterwards, 2992 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1205 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 50 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 7520 CheckedPairsTotal, 46 TotalNumberOfCompositions - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 724]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 2 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 474 SDtfs, 189 SDslu, 211 SDs, 0 SdLazy, 96 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 200 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...