./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-wmm/mix046_rmo.opt.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebe4efc711d092ae1c7491acf4c467474fa27626 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-9a8b2e8 [2020-10-20 02:58:11,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:58:11,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:58:11,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:58:11,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:58:11,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:58:11,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:58:11,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:58:11,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:58:11,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:58:11,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:58:11,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:58:11,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:58:11,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:58:11,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:58:11,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:58:11,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:58:11,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:58:11,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:58:11,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:58:11,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:58:11,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:58:11,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:58:11,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:58:11,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:58:11,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:58:11,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:58:11,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:58:11,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:58:11,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:58:11,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:58:11,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:58:11,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:58:11,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:58:11,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:58:11,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:58:11,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:58:11,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:58:11,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:58:11,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:58:11,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:58:11,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 02:58:11,396 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:58:11,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:58:11,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:58:11,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:58:11,398 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:58:11,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:58:11,399 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:58:11,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:58:11,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:58:11,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:58:11,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:58:11,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:58:11,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:58:11,401 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:58:11,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:58:11,401 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:58:11,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:58:11,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:58:11,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:58:11,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:58:11,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:58:11,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:58:11,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:58:11,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:58:11,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:58:11,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:58:11,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:58:11,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:58:11,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:58:11,405 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(reach_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 -> ebe4efc711d092ae1c7491acf4c467474fa27626 [2020-10-20 02:58:11,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:58:11,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:58:11,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:58:11,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:58:11,637 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:58:11,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i [2020-10-20 02:58:11,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9690365/e84c5ec8cf854d6daaa72a6246f16724/FLAGe6a45d0ff [2020-10-20 02:58:12,264 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:58:12,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_rmo.opt.i [2020-10-20 02:58:12,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9690365/e84c5ec8cf854d6daaa72a6246f16724/FLAGe6a45d0ff [2020-10-20 02:58:12,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9690365/e84c5ec8cf854d6daaa72a6246f16724 [2020-10-20 02:58:12,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:58:12,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:58:12,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:58:12,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:58:12,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:58:12,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:58:12" (1/1) ... [2020-10-20 02:58:12,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f1b98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:12, skipping insertion in model container [2020-10-20 02:58:12,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:58:12" (1/1) ... [2020-10-20 02:58:12,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:58:12,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:58:13,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:58:13,188 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:58:13,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:58:13,337 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:58:13,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13 WrapperNode [2020-10-20 02:58:13,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:58:13,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:58:13,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:58:13,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:58:13,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:58:13,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:58:13,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:58:13,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:58:13,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (1/1) ... [2020-10-20 02:58:13,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:58:13,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:58:13,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:58:13,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:58:13,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (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 [2020-10-20 02:58:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:58:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:58:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:58:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:58:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 02:58:13,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 02:58:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 02:58:13,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 02:58:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 02:58:13,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 02:58:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-20 02:58:13,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-20 02:58:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:58:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:58:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:58:13,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:58:13,535 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 02:58:15,640 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:58:15,640 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 02:58:15,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:58:15 BoogieIcfgContainer [2020-10-20 02:58:15,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:58:15,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:58:15,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:58:15,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:58:15,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:58:12" (1/3) ... [2020-10-20 02:58:15,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61db7356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:58:15, skipping insertion in model container [2020-10-20 02:58:15,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:58:13" (2/3) ... [2020-10-20 02:58:15,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61db7356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:58:15, skipping insertion in model container [2020-10-20 02:58:15,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:58:15" (3/3) ... [2020-10-20 02:58:15,654 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2020-10-20 02:58:15,667 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:58:15,667 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:58:15,675 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 02:58:15,677 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:58:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,729 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,729 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,730 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,742 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,743 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,749 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,750 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,751 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,753 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,754 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,756 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,756 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:58:15,757 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 02:58:15,773 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 02:58:15,798 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:58:15,798 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:58:15,798 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:58:15,798 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:58:15,798 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:58:15,798 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:58:15,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:58:15,799 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:58:15,823 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:58:15,831 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-20 02:58:15,835 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-20 02:58:15,838 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-20 02:58:15,943 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-20 02:58:15,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 02:58:15,954 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-20 02:58:15,964 INFO L117 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-20 02:58:16,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:58:16,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:16,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:16,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:16,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:16,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:16,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:16,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:16,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:16,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:16,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:16,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:16,881 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 02:58:17,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:17,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:17,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:17,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:17,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:17,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:17,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:17,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:17,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:17,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:17,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:17,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:58:17,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:17,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:58:17,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:17,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:58:17,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:17,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:58:17,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:18,460 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-20 02:58:18,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-20 02:58:18,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:18,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:58:18,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:19,361 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-20 02:58:19,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:58:19,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:19,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:58:19,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:19,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:58:19,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:19,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:58:19,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:58:19,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:19,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:19,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:19,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:19,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:19,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:19,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:19,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:19,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:19,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:19,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:19,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:19,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:19,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:19,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:19,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:20,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:20,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:20,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:20,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:20,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:20,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:20,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:20,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:20,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:20,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:20,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:20,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:20,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:58:20,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:20,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:58:20,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:58:20,724 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 02:58:21,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:58:21,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:58:22,408 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-20 02:58:22,607 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-20 02:58:22,615 INFO L132 LiptonReduction]: Checked pairs total: 7226 [2020-10-20 02:58:22,616 INFO L134 LiptonReduction]: Total number of compositions: 103 [2020-10-20 02:58:22,622 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-20 02:58:22,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-20 02:58:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-20 02:58:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:58:22,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:22,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:22,873 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 961632752, now seen corresponding path program 1 times [2020-10-20 02:58:22,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036465455] [2020-10-20 02:58:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:23,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036465455] [2020-10-20 02:58:23,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:23,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:58:23,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55852811] [2020-10-20 02:58:23,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:58:23,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:58:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:58:23,267 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-20 02:58:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:23,452 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-20 02:58:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:58:23,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 02:58:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:23,516 INFO L225 Difference]: With dead ends: 3082 [2020-10-20 02:58:23,516 INFO L226 Difference]: Without dead ends: 2602 [2020-10-20 02:58:23,517 INFO L677 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 [2020-10-20 02:58:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-20 02:58:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-20 02:58:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-20 02:58:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-20 02:58:24,003 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-20 02:58:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:24,005 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-20 02:58:24,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:58:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-20 02:58:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 02:58:24,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:24,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:24,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:58:24,010 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash 570752080, now seen corresponding path program 1 times [2020-10-20 02:58:24,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:24,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615171240] [2020-10-20 02:58:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:24,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615171240] [2020-10-20 02:58:24,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:24,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:58:24,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890955270] [2020-10-20 02:58:24,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:58:24,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:24,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:58:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:58:24,149 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-20 02:58:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:24,254 INFO L93 Difference]: Finished difference Result 3066 states and 11500 transitions. [2020-10-20 02:58:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:24,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 02:58:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:24,278 INFO L225 Difference]: With dead ends: 3066 [2020-10-20 02:58:24,279 INFO L226 Difference]: Without dead ends: 2586 [2020-10-20 02:58:24,279 INFO L677 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 [2020-10-20 02:58:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2020-10-20 02:58:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2586. [2020-10-20 02:58:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2020-10-20 02:58:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 9988 transitions. [2020-10-20 02:58:24,644 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 9988 transitions. Word has length 12 [2020-10-20 02:58:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:24,644 INFO L481 AbstractCegarLoop]: Abstraction has 2586 states and 9988 transitions. [2020-10-20 02:58:24,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:58:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 9988 transitions. [2020-10-20 02:58:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 02:58:24,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:24,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:24,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:58:24,650 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 526166796, now seen corresponding path program 1 times [2020-10-20 02:58:24,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:24,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321343072] [2020-10-20 02:58:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:24,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321343072] [2020-10-20 02:58:24,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:24,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:58:24,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408319596] [2020-10-20 02:58:24,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:58:24,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:58:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:58:24,805 INFO L87 Difference]: Start difference. First operand 2586 states and 9988 transitions. Second operand 4 states. [2020-10-20 02:58:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:24,875 INFO L93 Difference]: Finished difference Result 2754 states and 10314 transitions. [2020-10-20 02:58:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:24,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 02:58:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:24,897 INFO L225 Difference]: With dead ends: 2754 [2020-10-20 02:58:24,898 INFO L226 Difference]: Without dead ends: 2282 [2020-10-20 02:58:24,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-10-20 02:58:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-10-20 02:58:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-20 02:58:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-10-20 02:58:25,045 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-10-20 02:58:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:25,045 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-10-20 02:58:25,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:58:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-10-20 02:58:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 02:58:25,049 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:25,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:25,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:58:25,049 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:25,050 INFO L82 PathProgramCache]: Analyzing trace with hash -997779623, now seen corresponding path program 1 times [2020-10-20 02:58:25,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:25,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220907872] [2020-10-20 02:58:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:25,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220907872] [2020-10-20 02:58:25,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:25,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:58:25,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367257180] [2020-10-20 02:58:25,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:58:25,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:58:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:58:25,124 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-10-20 02:58:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:25,170 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-10-20 02:58:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:25,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 02:58:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:25,189 INFO L225 Difference]: With dead ends: 2538 [2020-10-20 02:58:25,190 INFO L226 Difference]: Without dead ends: 2218 [2020-10-20 02:58:25,190 INFO L677 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 [2020-10-20 02:58:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-20 02:58:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-10-20 02:58:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-10-20 02:58:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-10-20 02:58:25,270 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-10-20 02:58:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:25,270 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-10-20 02:58:25,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:58:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-10-20 02:58:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 02:58:25,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:25,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:25,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:58:25,274 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -894564587, now seen corresponding path program 1 times [2020-10-20 02:58:25,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:25,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511031079] [2020-10-20 02:58:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:25,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511031079] [2020-10-20 02:58:25,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:25,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:58:25,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495439448] [2020-10-20 02:58:25,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:58:25,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:58:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:58:25,496 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2020-10-20 02:58:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:25,655 INFO L93 Difference]: Finished difference Result 2410 states and 8888 transitions. [2020-10-20 02:58:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:58:25,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 02:58:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:25,681 INFO L225 Difference]: With dead ends: 2410 [2020-10-20 02:58:25,681 INFO L226 Difference]: Without dead ends: 2122 [2020-10-20 02:58:25,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:58:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-20 02:58:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-20 02:58:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-20 02:58:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7976 transitions. [2020-10-20 02:58:25,751 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 7976 transitions. Word has length 15 [2020-10-20 02:58:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:25,751 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 7976 transitions. [2020-10-20 02:58:25,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:58:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 7976 transitions. [2020-10-20 02:58:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:58:25,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:25,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:25,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:58:25,756 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:25,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1811455833, now seen corresponding path program 1 times [2020-10-20 02:58:25,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:25,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974629989] [2020-10-20 02:58:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:25,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974629989] [2020-10-20 02:58:25,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:25,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:58:25,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482549006] [2020-10-20 02:58:25,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:58:25,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:58:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:25,882 INFO L87 Difference]: Start difference. First operand 2122 states and 7976 transitions. Second operand 7 states. [2020-10-20 02:58:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:26,043 INFO L93 Difference]: Finished difference Result 2682 states and 10032 transitions. [2020-10-20 02:58:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:58:26,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 02:58:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:26,064 INFO L225 Difference]: With dead ends: 2682 [2020-10-20 02:58:26,064 INFO L226 Difference]: Without dead ends: 2490 [2020-10-20 02:58:26,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 02:58:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2020-10-20 02:58:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2282. [2020-10-20 02:58:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-20 02:58:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8632 transitions. [2020-10-20 02:58:26,146 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8632 transitions. Word has length 16 [2020-10-20 02:58:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:26,147 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8632 transitions. [2020-10-20 02:58:26,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:58:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8632 transitions. [2020-10-20 02:58:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:58:26,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:26,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:26,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:58:26,152 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2075999913, now seen corresponding path program 2 times [2020-10-20 02:58:26,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:26,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572183748] [2020-10-20 02:58:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:26,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572183748] [2020-10-20 02:58:26,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:26,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:58:26,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154207846] [2020-10-20 02:58:26,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:58:26,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:58:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:26,266 INFO L87 Difference]: Start difference. First operand 2282 states and 8632 transitions. Second operand 7 states. [2020-10-20 02:58:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:26,656 INFO L93 Difference]: Finished difference Result 2762 states and 10248 transitions. [2020-10-20 02:58:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 02:58:26,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 02:58:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:26,671 INFO L225 Difference]: With dead ends: 2762 [2020-10-20 02:58:26,671 INFO L226 Difference]: Without dead ends: 2506 [2020-10-20 02:58:26,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-20 02:58:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-20 02:58:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2346. [2020-10-20 02:58:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2020-10-20 02:58:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8744 transitions. [2020-10-20 02:58:26,747 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8744 transitions. Word has length 16 [2020-10-20 02:58:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:26,747 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 8744 transitions. [2020-10-20 02:58:26,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:58:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8744 transitions. [2020-10-20 02:58:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:58:26,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:26,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:26,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:58:26,753 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324700, now seen corresponding path program 1 times [2020-10-20 02:58:26,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:26,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747150983] [2020-10-20 02:58:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:26,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747150983] [2020-10-20 02:58:26,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:26,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:58:26,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874465939] [2020-10-20 02:58:26,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:58:26,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:58:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:58:26,999 INFO L87 Difference]: Start difference. First operand 2346 states and 8744 transitions. Second operand 8 states. [2020-10-20 02:58:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:27,161 INFO L93 Difference]: Finished difference Result 2922 states and 10872 transitions. [2020-10-20 02:58:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:58:27,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-20 02:58:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:27,174 INFO L225 Difference]: With dead ends: 2922 [2020-10-20 02:58:27,174 INFO L226 Difference]: Without dead ends: 2794 [2020-10-20 02:58:27,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 02:58:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2020-10-20 02:58:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2506. [2020-10-20 02:58:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-20 02:58:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9400 transitions. [2020-10-20 02:58:27,298 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9400 transitions. Word has length 17 [2020-10-20 02:58:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:27,299 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9400 transitions. [2020-10-20 02:58:27,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:58:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9400 transitions. [2020-10-20 02:58:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:58:27,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:27,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:27,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:58:27,305 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash 68230876, now seen corresponding path program 2 times [2020-10-20 02:58:27,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:27,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918121323] [2020-10-20 02:58:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:27,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918121323] [2020-10-20 02:58:27,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:27,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:58:27,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8390155] [2020-10-20 02:58:27,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:58:27,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:58:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:58:27,431 INFO L87 Difference]: Start difference. First operand 2506 states and 9400 transitions. Second operand 8 states. [2020-10-20 02:58:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:27,589 INFO L93 Difference]: Finished difference Result 2794 states and 10360 transitions. [2020-10-20 02:58:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:58:27,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-20 02:58:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:27,601 INFO L225 Difference]: With dead ends: 2794 [2020-10-20 02:58:27,601 INFO L226 Difference]: Without dead ends: 2666 [2020-10-20 02:58:27,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:58:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2020-10-20 02:58:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1930. [2020-10-20 02:58:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-20 02:58:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7176 transitions. [2020-10-20 02:58:27,710 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7176 transitions. Word has length 17 [2020-10-20 02:58:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:27,711 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7176 transitions. [2020-10-20 02:58:27,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:58:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7176 transitions. [2020-10-20 02:58:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:58:27,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:27,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:27,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:58:27,716 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash -684451050, now seen corresponding path program 1 times [2020-10-20 02:58:27,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:27,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549961396] [2020-10-20 02:58:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:27,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549961396] [2020-10-20 02:58:27,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:27,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:58:27,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999491656] [2020-10-20 02:58:27,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:58:27,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:58:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:58:27,797 INFO L87 Difference]: Start difference. First operand 1930 states and 7176 transitions. Second operand 4 states. [2020-10-20 02:58:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:27,837 INFO L93 Difference]: Finished difference Result 1990 states and 6760 transitions. [2020-10-20 02:58:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:27,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 02:58:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:27,844 INFO L225 Difference]: With dead ends: 1990 [2020-10-20 02:58:27,844 INFO L226 Difference]: Without dead ends: 1510 [2020-10-20 02:58:27,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-10-20 02:58:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2020-10-20 02:58:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2020-10-20 02:58:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 5076 transitions. [2020-10-20 02:58:27,885 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 5076 transitions. Word has length 17 [2020-10-20 02:58:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:27,885 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 5076 transitions. [2020-10-20 02:58:27,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:58:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 5076 transitions. [2020-10-20 02:58:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:58:27,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:27,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:27,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 02:58:27,890 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -100869773, now seen corresponding path program 1 times [2020-10-20 02:58:27,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:27,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502764377] [2020-10-20 02:58:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:27,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502764377] [2020-10-20 02:58:27,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:27,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:58:27,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257178084] [2020-10-20 02:58:27,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:58:27,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:27,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:58:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:27,952 INFO L87 Difference]: Start difference. First operand 1510 states and 5076 transitions. Second operand 5 states. [2020-10-20 02:58:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,008 INFO L93 Difference]: Finished difference Result 1286 states and 3965 transitions. [2020-10-20 02:58:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:58:28,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-20 02:58:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,012 INFO L225 Difference]: With dead ends: 1286 [2020-10-20 02:58:28,013 INFO L226 Difference]: Without dead ends: 986 [2020-10-20 02:58:28,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:58:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-10-20 02:58:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-10-20 02:58:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-10-20 02:58:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2980 transitions. [2020-10-20 02:58:28,048 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2980 transitions. Word has length 18 [2020-10-20 02:58:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,048 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 2980 transitions. [2020-10-20 02:58:28,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:58:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2980 transitions. [2020-10-20 02:58:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:58:28,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 02:58:28,052 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash 156009029, now seen corresponding path program 1 times [2020-10-20 02:58:28,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156082229] [2020-10-20 02:58:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:28,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156082229] [2020-10-20 02:58:28,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:28,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:58:28,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590593581] [2020-10-20 02:58:28,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:58:28,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:58:28,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:58:28,159 INFO L87 Difference]: Start difference. First operand 986 states and 2980 transitions. Second operand 4 states. [2020-10-20 02:58:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,198 INFO L93 Difference]: Finished difference Result 1449 states and 4230 transitions. [2020-10-20 02:58:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:28,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-20 02:58:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,202 INFO L225 Difference]: With dead ends: 1449 [2020-10-20 02:58:28,202 INFO L226 Difference]: Without dead ends: 1006 [2020-10-20 02:58:28,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-10-20 02:58:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2020-10-20 02:58:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-10-20 02:58:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2794 transitions. [2020-10-20 02:58:28,227 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2794 transitions. Word has length 20 [2020-10-20 02:58:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,228 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 2794 transitions. [2020-10-20 02:58:28,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:58:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2794 transitions. [2020-10-20 02:58:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:58:28,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 02:58:28,231 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -513981036, now seen corresponding path program 1 times [2020-10-20 02:58:28,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423699626] [2020-10-20 02:58:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:28,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423699626] [2020-10-20 02:58:28,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:28,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:58:28,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586153988] [2020-10-20 02:58:28,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:58:28,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:28,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:58:28,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:28,293 INFO L87 Difference]: Start difference. First operand 974 states and 2794 transitions. Second operand 5 states. [2020-10-20 02:58:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,342 INFO L93 Difference]: Finished difference Result 1305 states and 3677 transitions. [2020-10-20 02:58:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:28,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-20 02:58:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,345 INFO L225 Difference]: With dead ends: 1305 [2020-10-20 02:58:28,345 INFO L226 Difference]: Without dead ends: 584 [2020-10-20 02:58:28,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-10-20 02:58:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-10-20 02:58:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-10-20 02:58:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1537 transitions. [2020-10-20 02:58:28,358 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1537 transitions. Word has length 21 [2020-10-20 02:58:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,358 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1537 transitions. [2020-10-20 02:58:28,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:58:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1537 transitions. [2020-10-20 02:58:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:58:28,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 02:58:28,361 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1978467171, now seen corresponding path program 1 times [2020-10-20 02:58:28,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425922087] [2020-10-20 02:58:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:28,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425922087] [2020-10-20 02:58:28,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:28,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:58:28,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721186976] [2020-10-20 02:58:28,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:58:28,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:28,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:58:28,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:58:28,495 INFO L87 Difference]: Start difference. First operand 584 states and 1537 transitions. Second operand 6 states. [2020-10-20 02:58:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,565 INFO L93 Difference]: Finished difference Result 469 states and 1175 transitions. [2020-10-20 02:58:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:58:28,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-20 02:58:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,567 INFO L225 Difference]: With dead ends: 469 [2020-10-20 02:58:28,568 INFO L226 Difference]: Without dead ends: 400 [2020-10-20 02:58:28,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-20 02:58:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-10-20 02:58:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-20 02:58:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1007 transitions. [2020-10-20 02:58:28,579 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1007 transitions. Word has length 21 [2020-10-20 02:58:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,580 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1007 transitions. [2020-10-20 02:58:28,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:58:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1007 transitions. [2020-10-20 02:58:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:58:28,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 02:58:28,585 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -506826856, now seen corresponding path program 1 times [2020-10-20 02:58:28,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296267373] [2020-10-20 02:58:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:28,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296267373] [2020-10-20 02:58:28,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:28,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:58:28,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132291021] [2020-10-20 02:58:28,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:58:28,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:58:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:28,745 INFO L87 Difference]: Start difference. First operand 400 states and 1007 transitions. Second operand 7 states. [2020-10-20 02:58:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,824 INFO L93 Difference]: Finished difference Result 369 states and 944 transitions. [2020-10-20 02:58:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:58:28,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-20 02:58:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,826 INFO L225 Difference]: With dead ends: 369 [2020-10-20 02:58:28,826 INFO L226 Difference]: Without dead ends: 220 [2020-10-20 02:58:28,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:58:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-10-20 02:58:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-10-20 02:58:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-20 02:58:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 541 transitions. [2020-10-20 02:58:28,837 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 541 transitions. Word has length 24 [2020-10-20 02:58:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,837 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 541 transitions. [2020-10-20 02:58:28,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:58:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 541 transitions. [2020-10-20 02:58:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 02:58:28,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 02:58:28,840 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1954672749, now seen corresponding path program 1 times [2020-10-20 02:58:28,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624402821] [2020-10-20 02:58:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:28,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624402821] [2020-10-20 02:58:28,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:28,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:58:28,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958280302] [2020-10-20 02:58:28,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:58:28,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:58:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:58:28,946 INFO L87 Difference]: Start difference. First operand 220 states and 541 transitions. Second operand 5 states. [2020-10-20 02:58:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:28,982 INFO L93 Difference]: Finished difference Result 289 states and 705 transitions. [2020-10-20 02:58:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:58:28,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-20 02:58:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:28,983 INFO L225 Difference]: With dead ends: 289 [2020-10-20 02:58:28,983 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 02:58:28,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 02:58:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-20 02:58:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 02:58:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-10-20 02:58:28,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-10-20 02:58:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:28,988 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-10-20 02:58:28,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:58:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-10-20 02:58:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 02:58:28,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:28,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:28,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 02:58:28,989 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1748049593, now seen corresponding path program 2 times [2020-10-20 02:58:28,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:28,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780319505] [2020-10-20 02:58:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:58:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:58:29,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780319505] [2020-10-20 02:58:29,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:58:29,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:58:29,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361693988] [2020-10-20 02:58:29,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:58:29,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:58:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:58:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:58:29,164 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 7 states. [2020-10-20 02:58:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:58:29,242 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2020-10-20 02:58:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:58:29,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-20 02:58:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:58:29,243 INFO L225 Difference]: With dead ends: 120 [2020-10-20 02:58:29,243 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 02:58:29,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:58:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 02:58:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-20 02:58:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 02:58:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-20 02:58:29,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-10-20 02:58:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:58:29,247 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-20 02:58:29,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:58:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-20 02:58:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 02:58:29,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:58:29,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:58:29,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 02:58:29,248 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:58:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:58:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash -370388729, now seen corresponding path program 3 times [2020-10-20 02:58:29,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:58:29,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455659408] [2020-10-20 02:58:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:58:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:58:29,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:58:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:58:29,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:58:29,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:58:29,416 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:58:29,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 02:58:29,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,450 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,450 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-10-20 02:58:29,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:58:29 BasicIcfg [2020-10-20 02:58:29,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:58:29,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:58:29,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:58:29,592 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:58:29,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:58:15" (3/4) ... [2020-10-20 02:58:29,596 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:58:29,613 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,613 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,613 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,614 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-10-20 02:58:29,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:58:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:58:29,753 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:58:29,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:58:29,755 INFO L168 Benchmark]: Toolchain (without parser) took 17234.50 ms. Allocated memory was 36.2 MB in the beginning and 208.1 MB in the end (delta: 172.0 MB). Free memory was 17.6 MB in the beginning and 77.1 MB in the end (delta: -59.5 MB). Peak memory consumption was 112.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,755 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 33.6 MB. Free memory was 11.9 MB in the beginning and 11.8 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.78 ms. Allocated memory was 36.2 MB in the beginning and 45.6 MB in the end (delta: 9.4 MB). Free memory was 16.7 MB in the beginning and 13.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.70 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 13.1 MB in the beginning and 27.8 MB in the end (delta: -14.7 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,756 INFO L168 Benchmark]: Boogie Preprocessor took 42.47 ms. Allocated memory is still 46.1 MB. Free memory was 27.8 MB in the beginning and 25.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,757 INFO L168 Benchmark]: RCFGBuilder took 2188.77 ms. Allocated memory was 46.1 MB in the beginning and 71.3 MB in the end (delta: 25.2 MB). Free memory was 25.4 MB in the beginning and 25.3 MB in the end (delta: 174.6 kB). Peak memory consumption was 38.8 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,757 INFO L168 Benchmark]: TraceAbstraction took 13945.42 ms. Allocated memory was 71.3 MB in the beginning and 208.1 MB in the end (delta: 136.8 MB). Free memory was 24.6 MB in the beginning and 101.6 MB in the end (delta: -77.0 MB). Peak memory consumption was 59.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,757 INFO L168 Benchmark]: Witness Printer took 161.80 ms. Allocated memory is still 208.1 MB. Free memory was 101.6 MB in the beginning and 77.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:58:29,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 33.6 MB. Free memory was 11.9 MB in the beginning and 11.8 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 812.78 ms. Allocated memory was 36.2 MB in the beginning and 45.6 MB in the end (delta: 9.4 MB). Free memory was 16.7 MB in the beginning and 13.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 73.70 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 13.1 MB in the beginning and 27.8 MB in the end (delta: -14.7 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.47 ms. Allocated memory is still 46.1 MB. Free memory was 27.8 MB in the beginning and 25.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2188.77 ms. Allocated memory was 46.1 MB in the beginning and 71.3 MB in the end (delta: 25.2 MB). Free memory was 25.4 MB in the beginning and 25.3 MB in the end (delta: 174.6 kB). Peak memory consumption was 38.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 13945.42 ms. Allocated memory was 71.3 MB in the beginning and 208.1 MB in the end (delta: 136.8 MB). Free memory was 24.6 MB in the beginning and 101.6 MB in the end (delta: -77.0 MB). Peak memory consumption was 59.9 MB. Max. memory is 14.3 GB. * Witness Printer took 161.80 ms. Allocated memory is still 208.1 MB. Free memory was 101.6 MB in the beginning and 77.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1888 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 238 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.7s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 7226 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1237; [L847] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1238; [L849] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1239; [L851] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1240; [L853] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix046_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 689 SDtfs, 800 SDslu, 1498 SDs, 0 SdLazy, 476 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1424 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 33551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...