./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d056a1f 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-nondet/nondet-loop-bound-1.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 18f8c11d6085f6594f0f2021411e68b8ac706f42 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:15:15,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:15:15,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:15:15,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:15:15,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:15:15,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:15:15,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:15:15,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:15:15,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:15:15,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:15:15,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:15:15,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:15:15,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:15:15,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:15:15,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:15:15,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:15:15,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:15:15,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:15:15,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:15:15,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:15:15,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:15:15,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:15:15,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:15:15,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:15:15,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:15:15,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:15:15,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:15:15,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:15:15,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:15:15,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:15:15,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:15:15,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:15:15,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:15:15,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:15:15,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:15:15,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:15:15,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:15:15,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:15:15,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:15:15,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:15:15,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:15:15,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-22 14:15:15,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:15:15,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:15:15,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:15:15,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:15:15,454 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:15:15,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:15:15,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:15:15,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:15:15,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:15:15,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:15:15,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-22 14:15:15,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:15:15,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-22 14:15:15,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:15:15,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:15:15,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-22 14:15:15,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:15:15,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-22 14:15:15,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:15:15,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:15:15,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:15:15,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:15:15,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:15:15,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:15:15,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:15:15,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-22 14:15:15,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:15:15,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:15:15,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-22 14:15:15,462 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 -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-22 14:15:15,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:15:15,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:15:15,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:15:15,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:15:15,819 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:15:15,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 14:15:15,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfbca117/24daa6c47ccf49d5ad465af3c5cdc1b6/FLAG3c2d43d88 [2019-11-22 14:15:16,446 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:15:16,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 14:15:16,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfbca117/24daa6c47ccf49d5ad465af3c5cdc1b6/FLAG3c2d43d88 [2019-11-22 14:15:16,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfbca117/24daa6c47ccf49d5ad465af3c5cdc1b6 [2019-11-22 14:15:16,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:15:16,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-22 14:15:16,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:15:16,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:15:16,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:15:16,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:15:16" (1/1) ... [2019-11-22 14:15:16,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48af0003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:16, skipping insertion in model container [2019-11-22 14:15:16,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:15:16" (1/1) ... [2019-11-22 14:15:16,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:15:16,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:15:17,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:15:17,294 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:15:17,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:15:17,434 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:15:17,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17 WrapperNode [2019-11-22 14:15:17,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:15:17,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-22 14:15:17,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-22 14:15:17,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-22 14:15:17,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-22 14:15:17,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:15:17,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:15:17,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:15:17,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (1/1) ... [2019-11-22 14:15:17,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:15:17,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:15:17,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:15:17,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:15:17,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (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-22 14:15:17,581 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-22 14:15:17,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-22 14:15:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-22 14:15:17,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-22 14:15:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:15:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:15:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:15:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:15:17,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:15:17,585 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-22 14:15:17,945 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:15:17,945 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-22 14:15:17,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:15:17 BoogieIcfgContainer [2019-11-22 14:15:17,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:15:17,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:15:17,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:15:17,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:15:17,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:15:16" (1/3) ... [2019-11-22 14:15:17,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500941d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:15:17, skipping insertion in model container [2019-11-22 14:15:17,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:15:17" (2/3) ... [2019-11-22 14:15:17,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500941d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:15:17, skipping insertion in model container [2019-11-22 14:15:17,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:15:17" (3/3) ... [2019-11-22 14:15:17,954 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-22 14:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:17,999 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:17,999 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,003 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,006 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 14:15:18,039 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-22 14:15:18,039 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:15:18,047 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-22 14:15:18,057 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-22 14:15:18,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:15:18,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-22 14:15:18,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:15:18,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:15:18,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:15:18,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:15:18,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:15:18,074 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:15:18,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-22 14:15:22,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-22 14:15:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-22 14:15:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 14:15:22,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:22,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:22,103 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-22 14:15:22,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:22,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77067853] [2019-11-22 14:15:22,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:22,472 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-22 14:15:22,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77067853] [2019-11-22 14:15:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:15:22,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891763652] [2019-11-22 14:15:22,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:15:22,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:15:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:15:22,507 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-22 14:15:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:23,683 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-22 14:15:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:15:23,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-22 14:15:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:23,896 INFO L225 Difference]: With dead ends: 45470 [2019-11-22 14:15:23,896 INFO L226 Difference]: Without dead ends: 20819 [2019-11-22 14:15:23,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:15:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-22 14:15:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-22 14:15:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-22 14:15:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-22 14:15:24,945 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-22 14:15:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:24,946 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-22 14:15:24,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:15:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-22 14:15:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 14:15:24,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:24,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:24,950 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:24,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-22 14:15:24,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:24,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661674184] [2019-11-22 14:15:24,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:25,112 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-22 14:15:25,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661674184] [2019-11-22 14:15:25,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:25,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:15:25,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651578688] [2019-11-22 14:15:25,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:15:25,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:15:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:15:25,117 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-22 14:15:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:25,939 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-22 14:15:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:15:25,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-22 14:15:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:26,095 INFO L225 Difference]: With dead ends: 35069 [2019-11-22 14:15:26,095 INFO L226 Difference]: Without dead ends: 28819 [2019-11-22 14:15:26,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:15:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-22 14:15:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-22 14:15:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-22 14:15:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-22 14:15:26,953 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-22 14:15:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:26,954 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-22 14:15:26,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:15:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-22 14:15:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 14:15:26,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:26,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:26,965 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-22 14:15:26,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:26,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457910890] [2019-11-22 14:15:26,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:27,139 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-22 14:15:27,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457910890] [2019-11-22 14:15:27,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:27,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:15:27,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146900989] [2019-11-22 14:15:27,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:15:27,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:27,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:15:27,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:15:27,143 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-22 14:15:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:27,617 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-22 14:15:27,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:15:27,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-22 14:15:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:27,718 INFO L225 Difference]: With dead ends: 31729 [2019-11-22 14:15:27,719 INFO L226 Difference]: Without dead ends: 25345 [2019-11-22 14:15:27,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:15:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-22 14:15:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-22 14:15:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-22 14:15:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-22 14:15:28,881 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-22 14:15:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:28,883 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-22 14:15:28,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:15:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-22 14:15:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 14:15:28,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:28,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:28,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-22 14:15:28,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:28,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097082390] [2019-11-22 14:15:28,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:29,056 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-22 14:15:29,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097082390] [2019-11-22 14:15:29,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499006328] [2019-11-22 14:15:29,058 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-22 14:15:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:29,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:15:29,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:15:29,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:15:29,411 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-22 14:15:29,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:15:29,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 14:15:29,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011362293] [2019-11-22 14:15:29,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 14:15:29,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:29,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 14:15:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:15:29,415 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-22 14:15:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:30,276 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-22 14:15:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:30,277 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-22 14:15:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:30,414 INFO L225 Difference]: With dead ends: 34675 [2019-11-22 14:15:30,414 INFO L226 Difference]: Without dead ends: 32095 [2019-11-22 14:15:30,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:15:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-22 14:15:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-22 14:15:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-22 14:15:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-22 14:15:31,150 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-22 14:15:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:31,150 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-22 14:15:31,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 14:15:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-22 14:15:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 14:15:31,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:31,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:31,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:15:31,363 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:31,364 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-22 14:15:31,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:31,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203191709] [2019-11-22 14:15:31,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:31,509 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-22 14:15:31,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203191709] [2019-11-22 14:15:31,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:31,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:15:31,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874771476] [2019-11-22 14:15:31,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:15:31,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:15:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:15:31,512 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-22 14:15:32,073 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-22 14:15:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:32,308 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-22 14:15:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:32,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-22 14:15:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:32,398 INFO L225 Difference]: With dead ends: 32695 [2019-11-22 14:15:32,398 INFO L226 Difference]: Without dead ends: 29971 [2019-11-22 14:15:32,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:15:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-22 14:15:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-22 14:15:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-22 14:15:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-22 14:15:32,986 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-22 14:15:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:32,987 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-22 14:15:32,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:15:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-22 14:15:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-22 14:15:32,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:32,996 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:32,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-22 14:15:32,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:32,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196217819] [2019-11-22 14:15:32,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:33,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196217819] [2019-11-22 14:15:33,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:33,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:15:33,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442566986] [2019-11-22 14:15:33,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:15:33,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:15:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:15:33,126 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-22 14:15:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:33,419 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-22 14:15:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:15:33,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-22 14:15:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:33,454 INFO L225 Difference]: With dead ends: 22637 [2019-11-22 14:15:33,454 INFO L226 Difference]: Without dead ends: 16787 [2019-11-22 14:15:33,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:15:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-22 14:15:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-22 14:15:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-22 14:15:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-22 14:15:33,827 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-22 14:15:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:33,827 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-22 14:15:33,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:15:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-22 14:15:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 14:15:33,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:33,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:33,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-22 14:15:33,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:33,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543261247] [2019-11-22 14:15:33,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:33,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543261247] [2019-11-22 14:15:33,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750637924] [2019-11-22 14:15:33,992 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-22 14:15:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:34,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:15:34,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:15:34,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:15:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:34,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:15:34,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 14:15:34,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481818217] [2019-11-22 14:15:34,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 14:15:34,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:34,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 14:15:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:15:34,293 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-22 14:15:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:35,012 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-22 14:15:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:35,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-22 14:15:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:35,050 INFO L225 Difference]: With dead ends: 22447 [2019-11-22 14:15:35,051 INFO L226 Difference]: Without dead ends: 19931 [2019-11-22 14:15:35,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:15:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-22 14:15:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-22 14:15:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-22 14:15:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-22 14:15:35,351 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-22 14:15:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:35,351 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-22 14:15:35,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 14:15:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-22 14:15:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 14:15:35,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:35,373 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:35,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:15:35,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-22 14:15:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057274488] [2019-11-22 14:15:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:35,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057274488] [2019-11-22 14:15:35,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:35,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:15:35,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230706314] [2019-11-22 14:15:35,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:15:35,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:35,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:15:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:15:35,703 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-22 14:15:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:36,288 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-22 14:15:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:36,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 14:15:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:36,328 INFO L225 Difference]: With dead ends: 20531 [2019-11-22 14:15:36,328 INFO L226 Difference]: Without dead ends: 17621 [2019-11-22 14:15:36,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:15:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-22 14:15:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-22 14:15:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-22 14:15:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-22 14:15:36,770 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-22 14:15:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:36,770 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-22 14:15:36,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:15:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-22 14:15:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 14:15:36,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:36,782 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:36,783 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-22 14:15:36,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:36,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977249631] [2019-11-22 14:15:36,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:36,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977249631] [2019-11-22 14:15:36,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:36,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:15:36,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362342321] [2019-11-22 14:15:36,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:15:36,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:15:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:15:36,885 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-22 14:15:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:37,292 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-22 14:15:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 14:15:37,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 14:15:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:37,330 INFO L225 Difference]: With dead ends: 16565 [2019-11-22 14:15:37,331 INFO L226 Difference]: Without dead ends: 13655 [2019-11-22 14:15:37,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:15:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-22 14:15:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-22 14:15:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-22 14:15:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-22 14:15:37,561 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-22 14:15:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:37,561 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-22 14:15:37,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:15:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-22 14:15:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 14:15:37,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:37,569 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:37,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-22 14:15:37,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:37,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4168504] [2019-11-22 14:15:37,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:37,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4168504] [2019-11-22 14:15:37,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:37,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:15:37,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386792033] [2019-11-22 14:15:37,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:15:37,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:15:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:15:37,682 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-22 14:15:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:38,125 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-22 14:15:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 14:15:38,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 14:15:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:38,154 INFO L225 Difference]: With dead ends: 14255 [2019-11-22 14:15:38,154 INFO L226 Difference]: Without dead ends: 11219 [2019-11-22 14:15:38,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:15:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-22 14:15:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-22 14:15:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-22 14:15:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-22 14:15:38,339 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-22 14:15:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:38,339 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-22 14:15:38,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:15:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-22 14:15:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:38,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:38,350 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:38,350 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-22 14:15:38,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:38,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345821402] [2019-11-22 14:15:38,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:38,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345821402] [2019-11-22 14:15:38,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683469581] [2019-11-22 14:15:38,480 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-22 14:15:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:38,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 14:15:38,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:15:38,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:15:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:38,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:15:38,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 14:15:38,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632111631] [2019-11-22 14:15:38,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 14:15:38,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:38,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 14:15:38,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:15:38,744 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-22 14:15:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:39,686 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-22 14:15:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 14:15:39,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 14:15:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:39,705 INFO L225 Difference]: With dead ends: 11819 [2019-11-22 14:15:39,705 INFO L226 Difference]: Without dead ends: 10559 [2019-11-22 14:15:39,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-22 14:15:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-22 14:15:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-22 14:15:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-22 14:15:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-22 14:15:39,839 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-22 14:15:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:39,839 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-22 14:15:39,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 14:15:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-22 14:15:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:39,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:39,849 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:40,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:15:40,050 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-22 14:15:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:40,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422231482] [2019-11-22 14:15:40,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:40,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422231482] [2019-11-22 14:15:40,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305762481] [2019-11-22 14:15:40,166 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 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-22 14:15:40,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 14:15:40,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 14:15:40,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 14:15:40,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:15:40,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:15:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:15:40,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:15:40,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 14:15:40,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231977520] [2019-11-22 14:15:40,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 14:15:40,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 14:15:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:15:40,432 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-22 14:15:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:41,208 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-22 14:15:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 14:15:41,209 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 14:15:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:41,223 INFO L225 Difference]: With dead ends: 10319 [2019-11-22 14:15:41,223 INFO L226 Difference]: Without dead ends: 7997 [2019-11-22 14:15:41,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 14:15:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-22 14:15:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-22 14:15:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-22 14:15:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-22 14:15:41,420 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-22 14:15:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:41,421 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-22 14:15:41,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 14:15:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-22 14:15:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:41,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:41,429 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:41,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:15:41,630 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-22 14:15:41,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:41,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270042975] [2019-11-22 14:15:41,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:41,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270042975] [2019-11-22 14:15:41,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:41,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:15:41,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280515416] [2019-11-22 14:15:41,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:15:41,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:41,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:15:41,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:15:41,765 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-22 14:15:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:42,200 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-22 14:15:42,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:42,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 14:15:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:42,212 INFO L225 Difference]: With dead ends: 7757 [2019-11-22 14:15:42,213 INFO L226 Difference]: Without dead ends: 6497 [2019-11-22 14:15:42,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-22 14:15:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-22 14:15:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-22 14:15:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-22 14:15:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-22 14:15:42,300 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-22 14:15:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:42,301 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-22 14:15:42,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:15:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-22 14:15:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:42,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:42,308 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:42,308 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-22 14:15:42,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:42,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384834374] [2019-11-22 14:15:42,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:42,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384834374] [2019-11-22 14:15:42,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:42,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:15:42,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612856768] [2019-11-22 14:15:42,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:15:42,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:15:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:15:42,434 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-22 14:15:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:42,852 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-22 14:15:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 14:15:42,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 14:15:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:42,862 INFO L225 Difference]: With dead ends: 7097 [2019-11-22 14:15:42,862 INFO L226 Difference]: Without dead ends: 5027 [2019-11-22 14:15:42,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-22 14:15:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-22 14:15:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-22 14:15:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-22 14:15:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-22 14:15:42,928 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-22 14:15:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:42,928 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-22 14:15:42,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:15:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-22 14:15:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:42,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:42,934 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:42,934 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-22 14:15:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434181195] [2019-11-22 14:15:42,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:43,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434181195] [2019-11-22 14:15:43,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:43,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:15:43,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063983457] [2019-11-22 14:15:43,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:15:43,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:15:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:15:43,080 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-22 14:15:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:43,437 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-22 14:15:43,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:15:43,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 14:15:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:43,449 INFO L225 Difference]: With dead ends: 4787 [2019-11-22 14:15:43,450 INFO L226 Difference]: Without dead ends: 3527 [2019-11-22 14:15:43,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-22 14:15:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-22 14:15:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-22 14:15:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-22 14:15:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-22 14:15:43,550 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-22 14:15:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:43,550 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-22 14:15:43,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:15:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-22 14:15:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 14:15:43,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:15:43,562 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:15:43,563 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 14:15:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:15:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-22 14:15:43,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:15:43,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777829388] [2019-11-22 14:15:43,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:15:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:15:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:15:43,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777829388] [2019-11-22 14:15:43,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:15:43,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:15:43,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844723888] [2019-11-22 14:15:43,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:15:43,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:15:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:15:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:15:43,725 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-22 14:15:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:15:43,997 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-22 14:15:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:15:43,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 14:15:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:15:43,998 INFO L225 Difference]: With dead ends: 3287 [2019-11-22 14:15:43,998 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:15:43,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:15:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:15:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:15:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:15:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:15:44,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-22 14:15:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:15:44,000 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:15:44,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:15:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:15:44,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:15:44,004 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-22 14:15:44,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:15:44 BasicIcfg [2019-11-22 14:15:44,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:15:44,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:15:44,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:15:44,007 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:15:44,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:15:17" (3/4) ... [2019-11-22 14:15:44,011 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:15:44,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-22 14:15:44,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-22 14:15:44,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 14:15:44,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 14:15:44,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 14:15:44,068 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:15:44,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:15:44,070 INFO L168 Benchmark]: Toolchain (without parser) took 27318.83 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 960.4 MB in the beginning and 1.9 GB in the end (delta: -956.2 MB). Peak memory consumption was 833.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,070 INFO L168 Benchmark]: CDTParser took 0.88 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-22 14:15:44,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,072 INFO L168 Benchmark]: Boogie Preprocessor took 35.59 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-22 14:15:44,072 INFO L168 Benchmark]: RCFGBuilder took 424.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,073 INFO L168 Benchmark]: TraceAbstraction took 26058.78 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -875.8 MB). Peak memory consumption was 781.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,074 INFO L168 Benchmark]: Witness Printer took 61.55 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:15:44,077 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.88 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 682.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.59 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 424.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26058.78 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -875.8 MB). Peak memory consumption was 781.5 MB. Max. memory is 11.5 GB. * Witness Printer took 61.55 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: 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 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 25.9s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred 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: 6.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 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...