./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/01_inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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/01_inc.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 4d91aa845889f03c833da32b972f2eb6326d7db9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:32:02,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:32:02,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:32:02,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:32:02,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:32:02,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:32:02,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:32:02,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:32:02,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:32:02,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:32:02,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:32:02,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:32:02,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:32:02,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:32:02,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:32:02,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:32:02,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:32:02,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:32:02,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:32:02,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:32:02,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:32:02,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:32:02,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:32:02,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:32:02,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:32:02,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:32:02,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:32:02,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:32:02,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:32:02,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:32:02,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:32:02,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:32:02,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:32:02,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:32:02,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:32:02,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:32:02,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:32:02,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:32:02,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:32:02,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:32:02,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:32:02,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:32:02,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:32:02,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:32:02,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:32:02,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:32:02,557 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:32:02,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:32:02,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:32:02,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:32:02,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:32:02,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:32:02,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:32:02,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:32:02,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:32:02,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:32:02,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:32:02,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:32:02,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:32:02,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:32:02,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:32:02,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:32:02,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:32:02,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:32:02,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:32:02,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:32:02,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:32:02,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:32:02,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:32:02,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:32:02,562 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 -> 4d91aa845889f03c833da32b972f2eb6326d7db9 [2019-11-19 21:32:02,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:32:02,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:32:02,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:32:02,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:32:02,905 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:32:02,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/01_inc.i [2019-11-19 21:32:02,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedce758e/d8a53c4aa5f541dea62c34dc8b3ccb01/FLAGcc37e38b6 [2019-11-19 21:32:03,459 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:32:03,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/01_inc.i [2019-11-19 21:32:03,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedce758e/d8a53c4aa5f541dea62c34dc8b3ccb01/FLAGcc37e38b6 [2019-11-19 21:32:03,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedce758e/d8a53c4aa5f541dea62c34dc8b3ccb01 [2019-11-19 21:32:03,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:32:03,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:32:03,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:32:03,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:32:03,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:32:03,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:03" (1/1) ... [2019-11-19 21:32:03,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4415c148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:03, skipping insertion in model container [2019-11-19 21:32:03,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:03" (1/1) ... [2019-11-19 21:32:03,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:32:03,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:32:04,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:32:04,279 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:32:04,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:32:04,397 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:32:04,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04 WrapperNode [2019-11-19 21:32:04,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:32:04,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:32:04,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:32:04,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:32:04,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:32:04,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:32:04,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:32:04,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:32:04,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (1/1) ... [2019-11-19 21:32:04,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:32:04,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:32:04,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:32:04,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:32:04,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (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-19 21:32:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-19 21:32:04,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-19 21:32:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:32:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:32:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:32:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:32:04,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:32:04,542 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 21:32:04,665 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel [2019-11-19 21:32:04,665 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel [2019-11-19 21:32:04,666 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel#2 [2019-11-19 21:32:04,827 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:32:04,828 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 21:32:04,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:04 BoogieIcfgContainer [2019-11-19 21:32:04,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:32:04,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:32:04,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:32:04,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:32:04,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:32:03" (1/3) ... [2019-11-19 21:32:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb3642c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:04, skipping insertion in model container [2019-11-19 21:32:04,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:04" (2/3) ... [2019-11-19 21:32:04,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb3642c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:04, skipping insertion in model container [2019-11-19 21:32:04,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:04" (3/3) ... [2019-11-19 21:32:04,839 INFO L109 eAbstractionObserver]: Analyzing ICFG 01_inc.i [2019-11-19 21:32:04,880 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,880 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,881 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,881 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,881 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,883 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,885 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:32:04,911 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 21:32:04,911 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:32:04,919 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 21:32:04,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 21:32:04,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:32:04,948 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:32:04,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:32:04,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:32:04,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:32:04,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:32:04,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:32:04,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:32:04,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 59 transitions [2019-11-19 21:32:07,403 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19780 states. [2019-11-19 21:32:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states. [2019-11-19 21:32:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:32:07,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:07,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:07,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1441163796, now seen corresponding path program 1 times [2019-11-19 21:32:07,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:07,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657202036] [2019-11-19 21:32:07,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:07,787 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-19 21:32:07,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657202036] [2019-11-19 21:32:07,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:07,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:32:07,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839595077] [2019-11-19 21:32:07,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:32:07,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:32:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:32:07,816 INFO L87 Difference]: Start difference. First operand 19780 states. Second operand 5 states. [2019-11-19 21:32:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:08,232 INFO L93 Difference]: Finished difference Result 13175 states and 45395 transitions. [2019-11-19 21:32:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:32:08,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-19 21:32:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:08,355 INFO L225 Difference]: With dead ends: 13175 [2019-11-19 21:32:08,355 INFO L226 Difference]: Without dead ends: 12439 [2019-11-19 21:32:08,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:32:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12439 states. [2019-11-19 21:32:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12439 to 8479. [2019-11-19 21:32:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8479 states. [2019-11-19 21:32:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 29341 transitions. [2019-11-19 21:32:08,915 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 29341 transitions. Word has length 18 [2019-11-19 21:32:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:08,915 INFO L462 AbstractCegarLoop]: Abstraction has 8479 states and 29341 transitions. [2019-11-19 21:32:08,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:32:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 29341 transitions. [2019-11-19 21:32:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:32:08,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:08,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:08,919 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1623891675, now seen corresponding path program 1 times [2019-11-19 21:32:08,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:08,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312553492] [2019-11-19 21:32:08,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:09,085 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-19 21:32:09,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312553492] [2019-11-19 21:32:09,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:09,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:32:09,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095191559] [2019-11-19 21:32:09,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:32:09,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:32:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:32:09,092 INFO L87 Difference]: Start difference. First operand 8479 states and 29341 transitions. Second operand 5 states. [2019-11-19 21:32:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:09,462 INFO L93 Difference]: Finished difference Result 13219 states and 44824 transitions. [2019-11-19 21:32:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:32:09,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-19 21:32:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:09,527 INFO L225 Difference]: With dead ends: 13219 [2019-11-19 21:32:09,528 INFO L226 Difference]: Without dead ends: 13095 [2019-11-19 21:32:09,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:32:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13095 states. [2019-11-19 21:32:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13095 to 8883. [2019-11-19 21:32:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-11-19 21:32:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 30552 transitions. [2019-11-19 21:32:09,922 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 30552 transitions. Word has length 18 [2019-11-19 21:32:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:09,923 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 30552 transitions. [2019-11-19 21:32:09,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:32:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 30552 transitions. [2019-11-19 21:32:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:32:09,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:09,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:09,930 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1081687767, now seen corresponding path program 1 times [2019-11-19 21:32:09,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:09,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324069666] [2019-11-19 21:32:09,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:10,049 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-19 21:32:10,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324069666] [2019-11-19 21:32:10,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:10,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:32:10,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223151475] [2019-11-19 21:32:10,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:32:10,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:32:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:32:10,052 INFO L87 Difference]: Start difference. First operand 8883 states and 30552 transitions. Second operand 5 states. [2019-11-19 21:32:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:10,270 INFO L93 Difference]: Finished difference Result 13811 states and 46592 transitions. [2019-11-19 21:32:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:32:10,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-19 21:32:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:10,323 INFO L225 Difference]: With dead ends: 13811 [2019-11-19 21:32:10,323 INFO L226 Difference]: Without dead ends: 13687 [2019-11-19 21:32:10,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:32:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13687 states. [2019-11-19 21:32:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13687 to 9223. [2019-11-19 21:32:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9223 states. [2019-11-19 21:32:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 31483 transitions. [2019-11-19 21:32:10,697 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 31483 transitions. Word has length 18 [2019-11-19 21:32:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:10,698 INFO L462 AbstractCegarLoop]: Abstraction has 9223 states and 31483 transitions. [2019-11-19 21:32:10,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:32:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 31483 transitions. [2019-11-19 21:32:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:10,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:10,703 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:10,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1714977322, now seen corresponding path program 1 times [2019-11-19 21:32:10,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:10,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569013805] [2019-11-19 21:32:10,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569013805] [2019-11-19 21:32:10,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624096430] [2019-11-19 21:32:10,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:11,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:32:11,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:11,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:11,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-19 21:32:11,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287297701] [2019-11-19 21:32:11,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:32:11,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:32:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:32:11,139 INFO L87 Difference]: Start difference. First operand 9223 states and 31483 transitions. Second operand 11 states. [2019-11-19 21:32:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:12,021 INFO L93 Difference]: Finished difference Result 12547 states and 41221 transitions. [2019-11-19 21:32:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:32:12,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-19 21:32:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:12,071 INFO L225 Difference]: With dead ends: 12547 [2019-11-19 21:32:12,072 INFO L226 Difference]: Without dead ends: 12547 [2019-11-19 21:32:12,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:32:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states. [2019-11-19 21:32:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 6391. [2019-11-19 21:32:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6391 states. [2019-11-19 21:32:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6391 states to 6391 states and 21141 transitions. [2019-11-19 21:32:12,421 INFO L78 Accepts]: Start accepts. Automaton has 6391 states and 21141 transitions. Word has length 27 [2019-11-19 21:32:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:12,422 INFO L462 AbstractCegarLoop]: Abstraction has 6391 states and 21141 transitions. [2019-11-19 21:32:12,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6391 states and 21141 transitions. [2019-11-19 21:32:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:12,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:12,427 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:12,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:12,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 125589468, now seen corresponding path program 1 times [2019-11-19 21:32:12,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:12,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194858021] [2019-11-19 21:32:12,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:12,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194858021] [2019-11-19 21:32:12,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527871905] [2019-11-19 21:32:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:12,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:32:12,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:13,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:13,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-19 21:32:13,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840287189] [2019-11-19 21:32:13,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:32:13,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:32:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:32:13,040 INFO L87 Difference]: Start difference. First operand 6391 states and 21141 transitions. Second operand 11 states. [2019-11-19 21:32:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:13,745 INFO L93 Difference]: Finished difference Result 11743 states and 38472 transitions. [2019-11-19 21:32:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:32:13,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-19 21:32:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:13,791 INFO L225 Difference]: With dead ends: 11743 [2019-11-19 21:32:13,791 INFO L226 Difference]: Without dead ends: 11743 [2019-11-19 21:32:13,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:32:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11743 states. [2019-11-19 21:32:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11743 to 6511. [2019-11-19 21:32:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6511 states. [2019-11-19 21:32:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 21552 transitions. [2019-11-19 21:32:14,042 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 21552 transitions. Word has length 27 [2019-11-19 21:32:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 6511 states and 21552 transitions. [2019-11-19 21:32:14,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 21552 transitions. [2019-11-19 21:32:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:14,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:14,047 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:14,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:14,253 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:14,253 INFO L82 PathProgramCache]: Analyzing trace with hash -876668110, now seen corresponding path program 2 times [2019-11-19 21:32:14,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:14,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257046892] [2019-11-19 21:32:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:14,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257046892] [2019-11-19 21:32:14,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:14,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:32:14,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514874602] [2019-11-19 21:32:14,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:32:14,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:32:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:32:14,408 INFO L87 Difference]: Start difference. First operand 6511 states and 21552 transitions. Second operand 7 states. [2019-11-19 21:32:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:14,809 INFO L93 Difference]: Finished difference Result 9023 states and 29123 transitions. [2019-11-19 21:32:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:32:14,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-19 21:32:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:14,841 INFO L225 Difference]: With dead ends: 9023 [2019-11-19 21:32:14,841 INFO L226 Difference]: Without dead ends: 8875 [2019-11-19 21:32:14,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:32:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8875 states. [2019-11-19 21:32:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8875 to 5755. [2019-11-19 21:32:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5755 states. [2019-11-19 21:32:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 18648 transitions. [2019-11-19 21:32:15,050 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 18648 transitions. Word has length 27 [2019-11-19 21:32:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:15,052 INFO L462 AbstractCegarLoop]: Abstraction has 5755 states and 18648 transitions. [2019-11-19 21:32:15,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:32:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 18648 transitions. [2019-11-19 21:32:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:15,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:15,060 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:15,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1585381348, now seen corresponding path program 2 times [2019-11-19 21:32:15,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:15,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134957679] [2019-11-19 21:32:15,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:15,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134957679] [2019-11-19 21:32:15,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:15,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:32:15,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935595835] [2019-11-19 21:32:15,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:32:15,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:32:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:32:15,174 INFO L87 Difference]: Start difference. First operand 5755 states and 18648 transitions. Second operand 7 states. [2019-11-19 21:32:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:15,377 INFO L93 Difference]: Finished difference Result 8267 states and 26219 transitions. [2019-11-19 21:32:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:32:15,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-19 21:32:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:15,399 INFO L225 Difference]: With dead ends: 8267 [2019-11-19 21:32:15,399 INFO L226 Difference]: Without dead ends: 8119 [2019-11-19 21:32:15,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:32:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8119 states. [2019-11-19 21:32:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8119 to 4871. [2019-11-19 21:32:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-11-19 21:32:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 15376 transitions. [2019-11-19 21:32:15,553 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 15376 transitions. Word has length 27 [2019-11-19 21:32:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:15,553 INFO L462 AbstractCegarLoop]: Abstraction has 4871 states and 15376 transitions. [2019-11-19 21:32:15,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:32:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 15376 transitions. [2019-11-19 21:32:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:15,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:15,557 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:15,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1394571683, now seen corresponding path program 1 times [2019-11-19 21:32:15,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:15,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324095085] [2019-11-19 21:32:15,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:15,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324095085] [2019-11-19 21:32:15,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989804514] [2019-11-19 21:32:15,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:15,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:32:15,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:15,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:15,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-11-19 21:32:15,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847364942] [2019-11-19 21:32:15,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:32:15,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:32:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:32:15,733 INFO L87 Difference]: Start difference. First operand 4871 states and 15376 transitions. Second operand 9 states. [2019-11-19 21:32:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:15,999 INFO L93 Difference]: Finished difference Result 7491 states and 23505 transitions. [2019-11-19 21:32:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:32:16,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-19 21:32:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:16,016 INFO L225 Difference]: With dead ends: 7491 [2019-11-19 21:32:16,016 INFO L226 Difference]: Without dead ends: 7347 [2019-11-19 21:32:16,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:32:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7347 states. [2019-11-19 21:32:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7347 to 5103. [2019-11-19 21:32:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-11-19 21:32:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 16085 transitions. [2019-11-19 21:32:16,169 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 16085 transitions. Word has length 27 [2019-11-19 21:32:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:16,170 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 16085 transitions. [2019-11-19 21:32:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:32:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 16085 transitions. [2019-11-19 21:32:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:32:16,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:16,173 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:16,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:16,377 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -976093525, now seen corresponding path program 2 times [2019-11-19 21:32:16,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:16,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136519037] [2019-11-19 21:32:16,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:16,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136519037] [2019-11-19 21:32:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:16,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:32:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310125151] [2019-11-19 21:32:16,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:32:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:32:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:32:16,484 INFO L87 Difference]: Start difference. First operand 5103 states and 16085 transitions. Second operand 7 states. [2019-11-19 21:32:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:16,818 INFO L93 Difference]: Finished difference Result 8031 states and 24950 transitions. [2019-11-19 21:32:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 21:32:16,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-19 21:32:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:16,837 INFO L225 Difference]: With dead ends: 8031 [2019-11-19 21:32:16,837 INFO L226 Difference]: Without dead ends: 7859 [2019-11-19 21:32:16,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:32:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7859 states. [2019-11-19 21:32:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7859 to 4247. [2019-11-19 21:32:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4247 states. [2019-11-19 21:32:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 13072 transitions. [2019-11-19 21:32:16,976 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 13072 transitions. Word has length 27 [2019-11-19 21:32:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:16,976 INFO L462 AbstractCegarLoop]: Abstraction has 4247 states and 13072 transitions. [2019-11-19 21:32:16,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:32:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 13072 transitions. [2019-11-19 21:32:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:16,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:16,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:16,984 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1325943234, now seen corresponding path program 1 times [2019-11-19 21:32:16,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:16,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552523878] [2019-11-19 21:32:16,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:17,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552523878] [2019-11-19 21:32:17,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344964053] [2019-11-19 21:32:17,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:17,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:17,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:17,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:17,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2019-11-19 21:32:17,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290723883] [2019-11-19 21:32:17,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:32:17,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:32:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:32:17,275 INFO L87 Difference]: Start difference. First operand 4247 states and 13072 transitions. Second operand 12 states. [2019-11-19 21:32:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:17,681 INFO L93 Difference]: Finished difference Result 6047 states and 18654 transitions. [2019-11-19 21:32:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:32:17,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-19 21:32:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:17,690 INFO L225 Difference]: With dead ends: 6047 [2019-11-19 21:32:17,690 INFO L226 Difference]: Without dead ends: 5371 [2019-11-19 21:32:17,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:32:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2019-11-19 21:32:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4103. [2019-11-19 21:32:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2019-11-19 21:32:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 12604 transitions. [2019-11-19 21:32:17,928 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 12604 transitions. Word has length 36 [2019-11-19 21:32:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:17,929 INFO L462 AbstractCegarLoop]: Abstraction has 4103 states and 12604 transitions. [2019-11-19 21:32:17,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:32:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 12604 transitions. [2019-11-19 21:32:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:17,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:17,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:18,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:18,150 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 598358854, now seen corresponding path program 2 times [2019-11-19 21:32:18,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147761353] [2019-11-19 21:32:18,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:32:18,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147761353] [2019-11-19 21:32:18,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325178910] [2019-11-19 21:32:18,326 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:18,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-19 21:32:18,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:18,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:32:18,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 21:32:18,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:32:18,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-11-19 21:32:18,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671793852] [2019-11-19 21:32:18,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:32:18,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:32:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:32:18,474 INFO L87 Difference]: Start difference. First operand 4103 states and 12604 transitions. Second operand 5 states. [2019-11-19 21:32:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:18,632 INFO L93 Difference]: Finished difference Result 5983 states and 18590 transitions. [2019-11-19 21:32:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:32:18,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-11-19 21:32:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:18,642 INFO L225 Difference]: With dead ends: 5983 [2019-11-19 21:32:18,642 INFO L226 Difference]: Without dead ends: 5731 [2019-11-19 21:32:18,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:32:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5731 states. [2019-11-19 21:32:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5731 to 4039. [2019-11-19 21:32:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2019-11-19 21:32:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 12343 transitions. [2019-11-19 21:32:18,750 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 12343 transitions. Word has length 36 [2019-11-19 21:32:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:18,752 INFO L462 AbstractCegarLoop]: Abstraction has 4039 states and 12343 transitions. [2019-11-19 21:32:18,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:32:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 12343 transitions. [2019-11-19 21:32:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:18,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:18,760 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:18,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:18,970 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 598358438, now seen corresponding path program 1 times [2019-11-19 21:32:18,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:18,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138577761] [2019-11-19 21:32:18,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:32:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138577761] [2019-11-19 21:32:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182517689] [2019-11-19 21:32:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:19,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:19,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:32:19,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:19,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2019-11-19 21:32:19,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723271518] [2019-11-19 21:32:19,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:32:19,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:32:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:32:19,220 INFO L87 Difference]: Start difference. First operand 4039 states and 12343 transitions. Second operand 12 states. [2019-11-19 21:32:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:19,613 INFO L93 Difference]: Finished difference Result 4447 states and 13440 transitions. [2019-11-19 21:32:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:32:19,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-19 21:32:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:19,619 INFO L225 Difference]: With dead ends: 4447 [2019-11-19 21:32:19,619 INFO L226 Difference]: Without dead ends: 3771 [2019-11-19 21:32:19,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:32:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2019-11-19 21:32:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3643. [2019-11-19 21:32:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-11-19 21:32:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 11224 transitions. [2019-11-19 21:32:19,690 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 11224 transitions. Word has length 36 [2019-11-19 21:32:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:19,690 INFO L462 AbstractCegarLoop]: Abstraction has 3643 states and 11224 transitions. [2019-11-19 21:32:19,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:32:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 11224 transitions. [2019-11-19 21:32:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:19,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:19,700 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:19,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:19,904 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -190726602, now seen corresponding path program 3 times [2019-11-19 21:32:19,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:19,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208672330] [2019-11-19 21:32:19,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:20,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208672330] [2019-11-19 21:32:20,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741119575] [2019-11-19 21:32:20,049 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:20,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 21:32:20,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:20,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:20,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:20,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:20,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2019-11-19 21:32:20,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43054068] [2019-11-19 21:32:20,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:32:20,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:20,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:32:20,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:32:20,157 INFO L87 Difference]: Start difference. First operand 3643 states and 11224 transitions. Second operand 11 states. [2019-11-19 21:32:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:20,450 INFO L93 Difference]: Finished difference Result 5267 states and 16158 transitions. [2019-11-19 21:32:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 21:32:20,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-19 21:32:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:20,457 INFO L225 Difference]: With dead ends: 5267 [2019-11-19 21:32:20,457 INFO L226 Difference]: Without dead ends: 4735 [2019-11-19 21:32:20,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:32:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-11-19 21:32:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 3259. [2019-11-19 21:32:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2019-11-19 21:32:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 9944 transitions. [2019-11-19 21:32:20,534 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 9944 transitions. Word has length 36 [2019-11-19 21:32:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:20,534 INFO L462 AbstractCegarLoop]: Abstraction has 3259 states and 9944 transitions. [2019-11-19 21:32:20,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 9944 transitions. [2019-11-19 21:32:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:20,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:20,539 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:20,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:20,743 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1145614692, now seen corresponding path program 2 times [2019-11-19 21:32:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:20,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25547709] [2019-11-19 21:32:20,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:20,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25547709] [2019-11-19 21:32:20,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:20,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:32:20,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874312468] [2019-11-19 21:32:20,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:32:20,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:32:20,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:32:20,791 INFO L87 Difference]: Start difference. First operand 3259 states and 9944 transitions. Second operand 3 states. [2019-11-19 21:32:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:20,810 INFO L93 Difference]: Finished difference Result 2611 states and 7726 transitions. [2019-11-19 21:32:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:32:20,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-19 21:32:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:20,815 INFO L225 Difference]: With dead ends: 2611 [2019-11-19 21:32:20,815 INFO L226 Difference]: Without dead ends: 2467 [2019-11-19 21:32:20,816 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-19 21:32:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2019-11-19 21:32:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2467. [2019-11-19 21:32:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-11-19 21:32:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 7306 transitions. [2019-11-19 21:32:20,870 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 7306 transitions. Word has length 36 [2019-11-19 21:32:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:20,870 INFO L462 AbstractCegarLoop]: Abstraction has 2467 states and 7306 transitions. [2019-11-19 21:32:20,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:32:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 7306 transitions. [2019-11-19 21:32:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:20,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:20,875 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:20,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1269065278, now seen corresponding path program 4 times [2019-11-19 21:32:20,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:20,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895103088] [2019-11-19 21:32:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:21,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895103088] [2019-11-19 21:32:21,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816873963] [2019-11-19 21:32:21,013 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:21,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:32:21,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:21,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:21,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:32:21,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:21,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2019-11-19 21:32:21,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823165143] [2019-11-19 21:32:21,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:32:21,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:32:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:32:21,126 INFO L87 Difference]: Start difference. First operand 2467 states and 7306 transitions. Second operand 11 states. [2019-11-19 21:32:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:21,357 INFO L93 Difference]: Finished difference Result 2999 states and 8869 transitions. [2019-11-19 21:32:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 21:32:21,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-19 21:32:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:21,360 INFO L225 Difference]: With dead ends: 2999 [2019-11-19 21:32:21,360 INFO L226 Difference]: Without dead ends: 2071 [2019-11-19 21:32:21,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:32:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-11-19 21:32:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2071. [2019-11-19 21:32:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-11-19 21:32:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 6187 transitions. [2019-11-19 21:32:21,396 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 6187 transitions. Word has length 36 [2019-11-19 21:32:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:21,396 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 6187 transitions. [2019-11-19 21:32:21,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 6187 transitions. [2019-11-19 21:32:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:21,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:21,398 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:21,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:21,604 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -886282842, now seen corresponding path program 3 times [2019-11-19 21:32:21,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:21,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855832705] [2019-11-19 21:32:21,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 21:32:21,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855832705] [2019-11-19 21:32:21,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:21,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 21:32:21,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315594107] [2019-11-19 21:32:21,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:32:21,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:32:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:32:21,733 INFO L87 Difference]: Start difference. First operand 2071 states and 6187 transitions. Second operand 9 states. [2019-11-19 21:32:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:21,933 INFO L93 Difference]: Finished difference Result 2075 states and 6094 transitions. [2019-11-19 21:32:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:32:21,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-19 21:32:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:21,935 INFO L225 Difference]: With dead ends: 2075 [2019-11-19 21:32:21,936 INFO L226 Difference]: Without dead ends: 1651 [2019-11-19 21:32:21,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:32:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-11-19 21:32:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2019-11-19 21:32:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2019-11-19 21:32:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 4945 transitions. [2019-11-19 21:32:21,961 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 4945 transitions. Word has length 36 [2019-11-19 21:32:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:21,961 INFO L462 AbstractCegarLoop]: Abstraction has 1651 states and 4945 transitions. [2019-11-19 21:32:21,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:32:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 4945 transitions. [2019-11-19 21:32:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:32:21,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:21,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:21,963 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1744643910, now seen corresponding path program 5 times [2019-11-19 21:32:21,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:21,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397507883] [2019-11-19 21:32:21,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 21:32:22,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397507883] [2019-11-19 21:32:22,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:32:22,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 21:32:22,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074252795] [2019-11-19 21:32:22,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:32:22,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:32:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:32:22,205 INFO L87 Difference]: Start difference. First operand 1651 states and 4945 transitions. Second operand 9 states. [2019-11-19 21:32:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:22,379 INFO L93 Difference]: Finished difference Result 1043 states and 2905 transitions. [2019-11-19 21:32:22,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:32:22,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-19 21:32:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:22,379 INFO L225 Difference]: With dead ends: 1043 [2019-11-19 21:32:22,380 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:32:22,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:32:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:32:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:32:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:32:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:32:22,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-11-19 21:32:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:22,381 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:32:22,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:32:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:32:22,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:32:22,384 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 21:32:22,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:32:22 BasicIcfg [2019-11-19 21:32:22,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:32:22,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:32:22,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:32:22,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:32:22,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:04" (3/4) ... [2019-11-19 21:32:22,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:32:22,397 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-19 21:32:22,400 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 21:32:22,401 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 21:32:22,401 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:32:22,433 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:32:22,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:32:22,436 INFO L168 Benchmark]: Toolchain (without parser) took 18685.08 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 926.9 MB). Free memory was 955.0 MB in the beginning and 1.8 GB in the end (delta: -799.9 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:22,436 INFO L168 Benchmark]: CDTParser took 0.31 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-19 21:32:22,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:22,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.46 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:22,437 INFO L168 Benchmark]: Boogie Preprocessor took 24.52 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-19 21:32:22,438 INFO L168 Benchmark]: RCFGBuilder took 353.79 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:22,439 INFO L168 Benchmark]: TraceAbstraction took 17555.46 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 780.7 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -658.7 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:22,439 INFO L168 Benchmark]: Witness Printer took 47.40 ms. Allocated memory is still 2.0 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:32:22,442 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.31 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 647.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.46 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.52 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 353.79 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17555.46 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 780.7 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -658.7 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. * Witness Printer took 47.40 ms. Allocated memory is still 2.0 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 4 error locations. Result: SAFE, OverallTime: 17.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1597 SDtfs, 2677 SDslu, 5678 SDs, 0 SdLazy, 3036 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 257 SyntacticMatches, 9 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19780occurred 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: 3.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 40812 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 765 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 127252 SizeOfPredicates, 48 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 73/157 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...