./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.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 5f3104f8866991317081f2a037cd413a142d8b2f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:57:12,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:57:12,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:57:12,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:57:12,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:57:12,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:57:12,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:57:12,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:57:12,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:57:12,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:57:12,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:57:12,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:57:12,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:57:12,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:57:12,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:57:12,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:57:12,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:57:12,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:57:12,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:57:12,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:57:12,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:57:12,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:57:12,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:57:12,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:57:12,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:57:12,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:57:12,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:57:12,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:57:12,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:57:12,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:57:12,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:57:12,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:57:12,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:57:12,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:57:12,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:57:12,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:57:12,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:57:12,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:57:12,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:57:12,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:57:12,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:57:12,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:57:12,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:57:12,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:57:12,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:57:12,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:57:12,633 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:57:12,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:57:12,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:57:12,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:57:12,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:57:12,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:57:12,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:57:12,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:57:12,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:57:12,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:57:12,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:57:12,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:57:12,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:57:12,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:57:12,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:57:12,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:57:12,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:57:12,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:12,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:57:12,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:57:12,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:57:12,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:57:12,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:57:12,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:57:12,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:57:12,641 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 -> 5f3104f8866991317081f2a037cd413a142d8b2f [2019-11-28 17:57:13,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:57:13,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:57:13,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:57:13,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:57:13,061 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:57:13,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2019-11-28 17:57:13,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731aa1014/0be0acd6a7b34081bfdebef142a87cd5/FLAG4308b3d45 [2019-11-28 17:57:13,680 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:57:13,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2019-11-28 17:57:13,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731aa1014/0be0acd6a7b34081bfdebef142a87cd5/FLAG4308b3d45 [2019-11-28 17:57:13,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731aa1014/0be0acd6a7b34081bfdebef142a87cd5 [2019-11-28 17:57:13,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:57:13,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:57:13,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:13,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:57:13,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:57:13,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:13" (1/1) ... [2019-11-28 17:57:13,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2071a4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:13, skipping insertion in model container [2019-11-28 17:57:13,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:13" (1/1) ... [2019-11-28 17:57:13,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:57:14,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:57:14,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:14,532 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:57:14,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:14,694 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:57:14,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14 WrapperNode [2019-11-28 17:57:14,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:14,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:14,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:57:14,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:57:14,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:14,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:57:14,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:57:14,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:57:14,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:57:14,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:57:14,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:57:14,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:57:14,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-28 17:57:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-28 17:57:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-28 17:57:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-28 17:57:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:57:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 17:57:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:57:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:57:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 17:57:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:57:14,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:57:14,844 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 17:57:15,219 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:57:15,220 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 17:57:15,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:15 BoogieIcfgContainer [2019-11-28 17:57:15,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:57:15,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:57:15,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:57:15,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:57:15,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:57:13" (1/3) ... [2019-11-28 17:57:15,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e44ef1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:15, skipping insertion in model container [2019-11-28 17:57:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14" (2/3) ... [2019-11-28 17:57:15,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e44ef1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:15, skipping insertion in model container [2019-11-28 17:57:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:15" (3/3) ... [2019-11-28 17:57:15,229 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-11-28 17:57:15,238 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:57:15,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:57:15,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:57:15,245 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:57:15,267 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,268 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,268 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,268 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,269 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,269 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,269 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,269 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,269 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,270 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,270 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,270 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,270 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,270 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,271 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,272 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,272 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,272 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,272 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,273 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,273 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,273 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,274 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,274 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,274 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,274 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:15,293 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:57:15,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:57:15,309 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:57:15,310 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:57:15,310 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:57:15,310 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:57:15,310 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:57:15,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:57:15,311 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:57:15,321 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-11-28 17:57:15,323 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-11-28 17:57:15,361 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-11-28 17:57:15,362 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:15,375 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-11-28 17:57:15,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-11-28 17:57:15,393 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-11-28 17:57:15,394 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:15,395 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-11-28 17:57:15,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-11-28 17:57:15,399 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:57:16,465 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-28 17:57:16,597 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-11-28 17:57:16,597 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-11-28 17:57:16,602 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-11-28 17:57:16,614 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-11-28 17:57:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-28 17:57:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 17:57:16,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:16,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 17:57:16,625 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-11-28 17:57:16,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:16,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366520637] [2019-11-28 17:57:16,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:16,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366520637] [2019-11-28 17:57:16,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:16,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 17:57:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566977159] [2019-11-28 17:57:16,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:16,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:16,955 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-28 17:57:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:16,994 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-11-28 17:57:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:16,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 17:57:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:17,008 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:57:17,009 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:57:17,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:57:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 17:57:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 17:57:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-11-28 17:57:17,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-11-28 17:57:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:17,051 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-11-28 17:57:17,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-11-28 17:57:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 17:57:17,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:17,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:17,053 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-11-28 17:57:17,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:17,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034645961] [2019-11-28 17:57:17,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:17,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034645961] [2019-11-28 17:57:17,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:17,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:17,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032794258] [2019-11-28 17:57:17,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:57:17,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:57:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:57:17,182 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-11-28 17:57:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:17,225 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-11-28 17:57:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:17,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 17:57:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:17,228 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:57:17,228 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 17:57:17,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:57:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 17:57:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 17:57:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:57:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-11-28 17:57:17,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-11-28 17:57:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-11-28 17:57:17,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:57:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-11-28 17:57:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:57:17,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:17,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:17,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-11-28 17:57:17,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:17,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86753407] [2019-11-28 17:57:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:17,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86753407] [2019-11-28 17:57:17,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:17,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:17,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843041829] [2019-11-28 17:57:17,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:57:17,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:57:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:57:17,352 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-11-28 17:57:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:17,411 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-11-28 17:57:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:57:17,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:57:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:17,413 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:57:17,413 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:57:17,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:57:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:57:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-11-28 17:57:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 17:57:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-11-28 17:57:17,419 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-11-28 17:57:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:17,419 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-11-28 17:57:17,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:57:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-11-28 17:57:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:57:17,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:17,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:17,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-11-28 17:57:17,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:17,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624540197] [2019-11-28 17:57:17,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:17,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624540197] [2019-11-28 17:57:17,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:17,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:17,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718816710] [2019-11-28 17:57:17,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:57:17,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:57:17,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:57:17,504 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-11-28 17:57:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:17,587 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-11-28 17:57:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:57:17,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:57:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:17,589 INFO L225 Difference]: With dead ends: 32 [2019-11-28 17:57:17,590 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:57:17,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:57:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:57:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 17:57:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 17:57:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-11-28 17:57:17,599 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-11-28 17:57:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:17,600 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-11-28 17:57:17,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:57:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-11-28 17:57:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:57:17,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:17,604 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:17,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-11-28 17:57:17,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:17,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359516412] [2019-11-28 17:57:17,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:17,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359516412] [2019-11-28 17:57:17,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392950556] [2019-11-28 17:57:17,753 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 17:57:17,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 17:57:17,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:17,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 17:57:17,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:17,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:17,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 17:57:17,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362418412] [2019-11-28 17:57:17,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:57:17,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:57:17,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:57:17,889 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-11-28 17:57:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:17,951 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-11-28 17:57:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:57:17,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 17:57:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:17,953 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:57:17,954 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:57:17,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:57:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:57:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-28 17:57:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:57:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-11-28 17:57:17,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 10 [2019-11-28 17:57:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:17,959 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-11-28 17:57:17,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:57:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-11-28 17:57:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:57:17,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:17,960 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:18,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:18,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 4 times [2019-11-28 17:57:18,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:18,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539613108] [2019-11-28 17:57:18,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:18,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539613108] [2019-11-28 17:57:18,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645634799] [2019-11-28 17:57:18,305 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 17:57:18,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:57:18,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:18,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:57:18,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:18,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:18,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 17:57:18,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892026935] [2019-11-28 17:57:18,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:57:18,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:57:18,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:57:18,394 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-11-28 17:57:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:18,508 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-11-28 17:57:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:57:18,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-28 17:57:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:18,509 INFO L225 Difference]: With dead ends: 40 [2019-11-28 17:57:18,510 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 17:57:18,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:57:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 17:57:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-11-28 17:57:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:57:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2019-11-28 17:57:18,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 71 transitions. Word has length 11 [2019-11-28 17:57:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:18,517 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 71 transitions. [2019-11-28 17:57:18,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:57:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 71 transitions. [2019-11-28 17:57:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:57:18,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:18,518 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:18,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:18,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 5 times [2019-11-28 17:57:18,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:18,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019516250] [2019-11-28 17:57:18,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:18,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019516250] [2019-11-28 17:57:18,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531872939] [2019-11-28 17:57:18,805 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-28 17:57:18,865 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-28 17:57:18,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:18,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:57:18,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:18,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:18,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 17:57:18,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496298340] [2019-11-28 17:57:18,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:57:18,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:57:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:57:18,894 INFO L87 Difference]: Start difference. First operand 34 states and 71 transitions. Second operand 9 states. [2019-11-28 17:57:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:18,985 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-11-28 17:57:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:57:18,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-11-28 17:57:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:18,987 INFO L225 Difference]: With dead ends: 43 [2019-11-28 17:57:18,987 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 17:57:18,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:57:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 17:57:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-11-28 17:57:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 17:57:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-11-28 17:57:18,993 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 12 [2019-11-28 17:57:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:18,993 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-11-28 17:57:18,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:57:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-11-28 17:57:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:57:18,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:18,995 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:19,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:19,196 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 6 times [2019-11-28 17:57:19,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:19,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348338517] [2019-11-28 17:57:19,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:19,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348338517] [2019-11-28 17:57:19,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257905024] [2019-11-28 17:57:19,283 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-28 17:57:19,337 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-11-28 17:57:19,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:19,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:57:19,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:19,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:19,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 17:57:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630953407] [2019-11-28 17:57:19,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:57:19,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:57:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:57:19,381 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 10 states. [2019-11-28 17:57:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:19,529 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-11-28 17:57:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:57:19,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-28 17:57:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:19,530 INFO L225 Difference]: With dead ends: 51 [2019-11-28 17:57:19,530 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 17:57:19,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:57:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 17:57:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-28 17:57:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:57:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 79 transitions. [2019-11-28 17:57:19,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 79 transitions. Word has length 13 [2019-11-28 17:57:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:19,537 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 79 transitions. [2019-11-28 17:57:19,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:57:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 79 transitions. [2019-11-28 17:57:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:57:19,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:19,539 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:19,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:19,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 7 times [2019-11-28 17:57:19,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:19,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327292951] [2019-11-28 17:57:19,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:19,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327292951] [2019-11-28 17:57:19,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146594294] [2019-11-28 17:57:19,866 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:19,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 17:57:19,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:19,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:19,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 17:57:19,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331189181] [2019-11-28 17:57:19,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:57:19,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:57:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:57:19,967 INFO L87 Difference]: Start difference. First operand 38 states and 79 transitions. Second operand 11 states. [2019-11-28 17:57:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:20,106 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-11-28 17:57:20,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:57:20,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-11-28 17:57:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:20,107 INFO L225 Difference]: With dead ends: 53 [2019-11-28 17:57:20,107 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 17:57:20,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:57:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 17:57:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-28 17:57:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:57:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 83 transitions. [2019-11-28 17:57:20,114 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 83 transitions. Word has length 14 [2019-11-28 17:57:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:20,114 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 83 transitions. [2019-11-28 17:57:20,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:57:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 83 transitions. [2019-11-28 17:57:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:57:20,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:20,115 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:20,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:20,325 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 8 times [2019-11-28 17:57:20,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:20,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726096524] [2019-11-28 17:57:20,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:20,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726096524] [2019-11-28 17:57:20,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960238855] [2019-11-28 17:57:20,450 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:20,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:57:20,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:20,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 17:57:20,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:20,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:20,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 17:57:20,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147376950] [2019-11-28 17:57:20,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:57:20,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:57:20,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:57:20,545 INFO L87 Difference]: Start difference. First operand 40 states and 83 transitions. Second operand 12 states. [2019-11-28 17:57:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:20,737 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-11-28 17:57:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:57:20,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-11-28 17:57:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:20,738 INFO L225 Difference]: With dead ends: 49 [2019-11-28 17:57:20,738 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 17:57:20,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:57:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 17:57:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-28 17:57:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:57:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 87 transitions. [2019-11-28 17:57:20,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 87 transitions. Word has length 15 [2019-11-28 17:57:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:20,749 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 87 transitions. [2019-11-28 17:57:20,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:57:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 87 transitions. [2019-11-28 17:57:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:57:20,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:20,753 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:20,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:20,955 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 9 times [2019-11-28 17:57:20,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:20,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235766784] [2019-11-28 17:57:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:21,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235766784] [2019-11-28 17:57:21,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993411229] [2019-11-28 17:57:21,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:21,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 17:57:21,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:21,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:57:21,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:21,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:21,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 17:57:21,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903519059] [2019-11-28 17:57:21,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:57:21,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:21,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:57:21,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:57:21,220 INFO L87 Difference]: Start difference. First operand 42 states and 87 transitions. Second operand 13 states. [2019-11-28 17:57:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:21,438 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-11-28 17:57:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 17:57:21,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-11-28 17:57:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:21,439 INFO L225 Difference]: With dead ends: 51 [2019-11-28 17:57:21,439 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 17:57:21,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:57:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 17:57:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-28 17:57:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:57:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-11-28 17:57:21,450 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-11-28 17:57:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:21,450 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-11-28 17:57:21,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:57:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-11-28 17:57:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:21,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:21,456 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:21,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:21,665 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 10 times [2019-11-28 17:57:21,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:21,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978127273] [2019-11-28 17:57:21,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:21,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:57:21,730 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:57:21,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-11-28 17:57:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-11-28 17:57:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_2 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_2 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_2, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_2, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_2) (= v_t2Thread1of1ForFork0_~arg.offset_2 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_2, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_2, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (or (not (= v_ULTIMATE.start_main_~condI~0_15 0)) (not (= v_ULTIMATE.start_main_~condJ~0_15 0))) (= v_ULTIMATE.start_main_~condI~0_15 (ite (<= 16 v_~i~0_25) 1 0)) (= (ite (<= 16 v_~j~0_27) 1 0) v_ULTIMATE.start_main_~condJ~0_15)) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-11-28 17:57:21,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:57:21 BasicIcfg [2019-11-28 17:57:21,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:57:21,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:57:21,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:57:21,763 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:57:21,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:15" (3/4) ... [2019-11-28 17:57:21,766 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:57:21,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-11-28 17:57:21,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-11-28 17:57:21,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_2 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_2 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_2, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_2, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_2) (= v_t2Thread1of1ForFork0_~arg.offset_2 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_2, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_2, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_18 5) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-11-28 17:57:21,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 5) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-11-28 17:57:21,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (or (not (= v_ULTIMATE.start_main_~condI~0_15 0)) (not (= v_ULTIMATE.start_main_~condJ~0_15 0))) (= v_ULTIMATE.start_main_~condI~0_15 (ite (<= 16 v_~i~0_25) 1 0)) (= (ite (<= 16 v_~j~0_27) 1 0) v_ULTIMATE.start_main_~condJ~0_15)) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-11-28 17:57:21,818 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:57:21,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:57:21,821 INFO L168 Benchmark]: Toolchain (without parser) took 7870.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 951.0 MB in the beginning and 852.4 MB in the end (delta: 98.6 MB). Peak memory consumption was 273.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:21,822 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:21,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -110.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:21,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:21,824 INFO L168 Benchmark]: Boogie Preprocessor took 30.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:21,825 INFO L168 Benchmark]: RCFGBuilder took 445.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:21,826 INFO L168 Benchmark]: TraceAbstraction took 6539.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 852.4 MB in the end (delta: 177.3 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:21,826 INFO L168 Benchmark]: Witness Printer took 56.85 ms. Allocated memory is still 1.2 GB. Free memory was 852.4 MB in the beginning and 852.4 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 17:57:21,830 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.95 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 739.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -110.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 445.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6539.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 852.4 MB in the end (delta: 177.3 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. * Witness Printer took 56.85 ms. Allocated memory is still 1.2 GB. Free memory was 852.4 MB in the beginning and 852.4 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.4s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 104 SDtfs, 299 SDslu, 182 SDs, 0 SdLazy, 222 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 7748 SizeOfPredicates, 35 NumberOfNonLiveVariables, 686 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 0/100 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 incorrect! Received shutdown request...