/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:46:23,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:46:23,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:46:23,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:46:23,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:46:23,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:46:23,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:46:23,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:46:23,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:46:23,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:46:23,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:46:23,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:46:23,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:46:23,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:46:23,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:46:23,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:46:23,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:46:23,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:46:23,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:46:23,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:46:23,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:46:23,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:46:23,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:46:23,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:46:23,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:46:23,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:46:23,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:46:23,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:46:23,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:46:23,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:46:23,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:46:23,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:46:23,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:46:23,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:46:23,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:46:23,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:46:23,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:46:23,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:46:23,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:46:23,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:46:23,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:46:23,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:46:23,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:46:23,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:46:23,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:46:23,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:46:23,330 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:46:23,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:46:23,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:46:23,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:46:23,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:46:23,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:46:23,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:46:23,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:46:23,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:46:23,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:46:23,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:46:23,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:46:23,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:46:23,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:46:23,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:46:23,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:46:23,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:46:23,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:23,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:46:23,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:46:23,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:46:23,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:46:23,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:46:23,336 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:46:23,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:46:23,336 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:46:23,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:46:23,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:46:23,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:46:23,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:46:23,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:46:23,678 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:46:23,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-27 18:46:23,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abff757a0/cc34f74c70434017968b703254c088e8/FLAGc21969636 [2019-12-27 18:46:24,317 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:46:24,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-27 18:46:24,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abff757a0/cc34f74c70434017968b703254c088e8/FLAGc21969636 [2019-12-27 18:46:24,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abff757a0/cc34f74c70434017968b703254c088e8 [2019-12-27 18:46:24,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:46:24,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:46:24,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:24,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:46:24,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:46:24,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:24" (1/1) ... [2019-12-27 18:46:24,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:24, skipping insertion in model container [2019-12-27 18:46:24,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:24" (1/1) ... [2019-12-27 18:46:24,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:46:24,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:46:25,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:25,208 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:46:25,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:25,395 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:46:25,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25 WrapperNode [2019-12-27 18:46:25,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:25,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:25,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:46:25,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:46:25,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:25,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:46:25,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:46:25,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:46:25,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... [2019-12-27 18:46:25,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:46:25,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:46:25,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:46:25,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:46:25,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:46:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:46:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:46:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:46:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:46:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:46:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:46:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:46:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:46:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:46:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:46:25,578 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:46:26,299 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:46:26,299 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:46:26,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:26 BoogieIcfgContainer [2019-12-27 18:46:26,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:46:26,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:46:26,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:46:26,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:46:26,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:46:24" (1/3) ... [2019-12-27 18:46:26,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3609e4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:26, skipping insertion in model container [2019-12-27 18:46:26,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:25" (2/3) ... [2019-12-27 18:46:26,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3609e4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:26, skipping insertion in model container [2019-12-27 18:46:26,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:26" (3/3) ... [2019-12-27 18:46:26,310 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2019-12-27 18:46:26,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:46:26,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:46:26,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:46:26,331 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:46:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,395 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,395 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:26,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:46:26,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:46:26,429 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:46:26,429 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:46:26,429 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:46:26,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:46:26,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:46:26,430 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:46:26,430 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:46:26,448 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 18:46:26,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:26,568 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:26,569 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:26,586 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:26,603 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:26,691 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:26,692 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:26,703 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:26,720 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 18:46:26,721 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:31,088 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 18:46:31,214 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 18:46:31,248 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-27 18:46:31,248 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-27 18:46:31,252 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 18:46:31,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-27 18:46:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-27 18:46:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:46:31,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:31,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:46:31,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:31,825 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-27 18:46:31,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:31,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802246194] [2019-12-27 18:46:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:32,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802246194] [2019-12-27 18:46:32,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:32,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:46:32,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619527027] [2019-12-27 18:46:32,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:32,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:32,151 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:46:32,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:32,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:32,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:32,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:32,174 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-27 18:46:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:32,424 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-27 18:46:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:32,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:46:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:32,519 INFO L225 Difference]: With dead ends: 8560 [2019-12-27 18:46:32,519 INFO L226 Difference]: Without dead ends: 8391 [2019-12-27 18:46:32,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-27 18:46:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-27 18:46:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-27 18:46:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-27 18:46:33,059 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-27 18:46:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:33,060 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-27 18:46:33,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-27 18:46:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:33,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:33,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:33,063 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-27 18:46:33,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:33,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603266339] [2019-12-27 18:46:33,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:33,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603266339] [2019-12-27 18:46:33,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:33,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:33,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210250870] [2019-12-27 18:46:33,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:33,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:33,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 18:46:33,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:33,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:33,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:33,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:33,213 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-27 18:46:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:33,683 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-27 18:46:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:33,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:33,780 INFO L225 Difference]: With dead ends: 13399 [2019-12-27 18:46:33,780 INFO L226 Difference]: Without dead ends: 13392 [2019-12-27 18:46:33,783 INFO L631 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 [2019-12-27 18:46:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-27 18:46:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-27 18:46:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-27 18:46:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-27 18:46:34,379 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-27 18:46:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:34,380 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-27 18:46:34,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-27 18:46:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:34,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:34,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:34,389 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-27 18:46:34,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:34,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303363238] [2019-12-27 18:46:34,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:34,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303363238] [2019-12-27 18:46:34,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:34,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:34,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053089770] [2019-12-27 18:46:34,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:34,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:34,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:34,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:34,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:34,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:34,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:34,529 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-27 18:46:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:34,573 INFO L93 Difference]: Finished difference Result 1949 states and 4516 transitions. [2019-12-27 18:46:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:46:34,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:34,579 INFO L225 Difference]: With dead ends: 1949 [2019-12-27 18:46:34,579 INFO L226 Difference]: Without dead ends: 1663 [2019-12-27 18:46:34,580 INFO L631 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 [2019-12-27 18:46:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-27 18:46:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2019-12-27 18:46:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-12-27 18:46:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3725 transitions. [2019-12-27 18:46:34,623 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3725 transitions. Word has length 11 [2019-12-27 18:46:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:34,626 INFO L462 AbstractCegarLoop]: Abstraction has 1663 states and 3725 transitions. [2019-12-27 18:46:34,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3725 transitions. [2019-12-27 18:46:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:46:34,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:34,628 INFO L411 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] [2019-12-27 18:46:34,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1402369775, now seen corresponding path program 1 times [2019-12-27 18:46:34,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:34,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980711843] [2019-12-27 18:46:34,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:34,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980711843] [2019-12-27 18:46:34,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:34,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166587417] [2019-12-27 18:46:34,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:34,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:34,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 18:46:34,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:34,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:34,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:34,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:34,784 INFO L87 Difference]: Start difference. First operand 1663 states and 3725 transitions. Second operand 5 states. [2019-12-27 18:46:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:34,833 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-27 18:46:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:34,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 18:46:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:34,836 INFO L225 Difference]: With dead ends: 403 [2019-12-27 18:46:34,836 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 18:46:34,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 18:46:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 18:46:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 18:46:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-27 18:46:34,844 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-27 18:46:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:34,844 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-27 18:46:34,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-27 18:46:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:34,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:34,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:34,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1079059862, now seen corresponding path program 1 times [2019-12-27 18:46:34,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:34,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570211263] [2019-12-27 18:46:34,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:34,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570211263] [2019-12-27 18:46:34,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:34,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:34,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787976899] [2019-12-27 18:46:34,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:34,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:35,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 97 transitions. [2019-12-27 18:46:35,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:35,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:35,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:35,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:35,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:35,031 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-27 18:46:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:35,081 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-12-27 18:46:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:35,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 18:46:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:35,082 INFO L225 Difference]: With dead ends: 332 [2019-12-27 18:46:35,082 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 18:46:35,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 18:46:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 18:46:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 18:46:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-12-27 18:46:35,090 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-12-27 18:46:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:35,091 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-12-27 18:46:35,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-12-27 18:46:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:35,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:35,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:35,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-27 18:46:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:35,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17401524] [2019-12-27 18:46:35,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:35,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17401524] [2019-12-27 18:46:35,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:35,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:35,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932455179] [2019-12-27 18:46:35,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:35,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:35,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 97 transitions. [2019-12-27 18:46:35,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:35,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:46:35,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:35,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:35,629 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 6 states. [2019-12-27 18:46:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:35,968 INFO L93 Difference]: Finished difference Result 523 states and 965 transitions. [2019-12-27 18:46:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:46:35,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 18:46:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:35,971 INFO L225 Difference]: With dead ends: 523 [2019-12-27 18:46:35,971 INFO L226 Difference]: Without dead ends: 523 [2019-12-27 18:46:35,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:46:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-27 18:46:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 375. [2019-12-27 18:46:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 18:46:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 692 transitions. [2019-12-27 18:46:35,983 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 692 transitions. Word has length 52 [2019-12-27 18:46:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:35,983 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 692 transitions. [2019-12-27 18:46:35,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 692 transitions. [2019-12-27 18:46:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:35,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:35,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:35,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-27 18:46:35,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:35,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454643147] [2019-12-27 18:46:35,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:36,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454643147] [2019-12-27 18:46:36,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:36,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:46:36,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136404472] [2019-12-27 18:46:36,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:36,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:36,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 115 transitions. [2019-12-27 18:46:36,155 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:36,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:46:36,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:46:36,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:36,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:46:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:46:36,241 INFO L87 Difference]: Start difference. First operand 375 states and 692 transitions. Second operand 10 states. [2019-12-27 18:46:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:37,403 INFO L93 Difference]: Finished difference Result 933 states and 1616 transitions. [2019-12-27 18:46:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:46:37,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 18:46:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:37,408 INFO L225 Difference]: With dead ends: 933 [2019-12-27 18:46:37,408 INFO L226 Difference]: Without dead ends: 933 [2019-12-27 18:46:37,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:46:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-27 18:46:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 405. [2019-12-27 18:46:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-27 18:46:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 752 transitions. [2019-12-27 18:46:37,420 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 752 transitions. Word has length 52 [2019-12-27 18:46:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 752 transitions. [2019-12-27 18:46:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:46:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 752 transitions. [2019-12-27 18:46:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:37,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:37,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:37,423 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-27 18:46:37,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:37,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341976479] [2019-12-27 18:46:37,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:37,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341976479] [2019-12-27 18:46:37,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:37,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:37,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258313517] [2019-12-27 18:46:37,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:37,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:37,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 104 transitions. [2019-12-27 18:46:37,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:37,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:46:37,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:37,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:37,543 INFO L87 Difference]: Start difference. First operand 405 states and 752 transitions. Second operand 5 states. [2019-12-27 18:46:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:37,722 INFO L93 Difference]: Finished difference Result 452 states and 803 transitions. [2019-12-27 18:46:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:37,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:46:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:37,724 INFO L225 Difference]: With dead ends: 452 [2019-12-27 18:46:37,724 INFO L226 Difference]: Without dead ends: 452 [2019-12-27 18:46:37,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-27 18:46:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 363. [2019-12-27 18:46:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 18:46:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 655 transitions. [2019-12-27 18:46:37,733 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 655 transitions. Word has length 52 [2019-12-27 18:46:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 655 transitions. [2019-12-27 18:46:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 655 transitions. [2019-12-27 18:46:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:37,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:37,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:37,735 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash -798948617, now seen corresponding path program 1 times [2019-12-27 18:46:37,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:37,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128785803] [2019-12-27 18:46:37,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:37,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128785803] [2019-12-27 18:46:37,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:37,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:37,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [269157808] [2019-12-27 18:46:37,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:37,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:37,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 18:46:37,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:37,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:37,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:37,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:37,850 INFO L87 Difference]: Start difference. First operand 363 states and 655 transitions. Second operand 3 states. [2019-12-27 18:46:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:37,889 INFO L93 Difference]: Finished difference Result 362 states and 653 transitions. [2019-12-27 18:46:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:37,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:46:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:37,891 INFO L225 Difference]: With dead ends: 362 [2019-12-27 18:46:37,891 INFO L226 Difference]: Without dead ends: 362 [2019-12-27 18:46:37,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-27 18:46:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 273. [2019-12-27 18:46:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-27 18:46:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 492 transitions. [2019-12-27 18:46:37,898 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 492 transitions. Word has length 53 [2019-12-27 18:46:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:37,899 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 492 transitions. [2019-12-27 18:46:37,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 492 transitions. [2019-12-27 18:46:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:37,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:37,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:37,900 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-27 18:46:37,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:37,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484214096] [2019-12-27 18:46:37,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:38,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484214096] [2019-12-27 18:46:38,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:38,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:38,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187805129] [2019-12-27 18:46:38,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:38,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:38,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 122 transitions. [2019-12-27 18:46:38,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:38,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:38,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:38,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:38,091 INFO L87 Difference]: Start difference. First operand 273 states and 492 transitions. Second operand 5 states. [2019-12-27 18:46:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:38,136 INFO L93 Difference]: Finished difference Result 463 states and 826 transitions. [2019-12-27 18:46:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:38,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 18:46:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:38,138 INFO L225 Difference]: With dead ends: 463 [2019-12-27 18:46:38,138 INFO L226 Difference]: Without dead ends: 209 [2019-12-27 18:46:38,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-27 18:46:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-27 18:46:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 18:46:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 18:46:38,143 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-12-27 18:46:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:38,143 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 18:46:38,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 18:46:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:38,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:38,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:38,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-27 18:46:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:38,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346579738] [2019-12-27 18:46:38,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:38,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346579738] [2019-12-27 18:46:38,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:38,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:46:38,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672815513] [2019-12-27 18:46:38,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:38,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:38,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 99 transitions. [2019-12-27 18:46:38,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:38,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:46:38,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:46:38,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:46:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:46:38,626 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 16 states. [2019-12-27 18:46:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:40,331 INFO L93 Difference]: Finished difference Result 531 states and 892 transitions. [2019-12-27 18:46:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 18:46:40,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 18:46:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:40,333 INFO L225 Difference]: With dead ends: 531 [2019-12-27 18:46:40,333 INFO L226 Difference]: Without dead ends: 499 [2019-12-27 18:46:40,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 18:46:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-12-27 18:46:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 309. [2019-12-27 18:46:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 18:46:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-27 18:46:40,342 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 54 [2019-12-27 18:46:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:40,342 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-27 18:46:40,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:46:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-27 18:46:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:40,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:40,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:40,344 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-12-27 18:46:40,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:40,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208014959] [2019-12-27 18:46:40,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:40,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208014959] [2019-12-27 18:46:40,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:40,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:46:40,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584476028] [2019-12-27 18:46:40,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:40,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:40,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 86 transitions. [2019-12-27 18:46:40,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:40,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:40,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:46:40,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:40,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:46:40,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:46:40,677 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 14 states. [2019-12-27 18:46:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:41,126 INFO L93 Difference]: Finished difference Result 411 states and 689 transitions. [2019-12-27 18:46:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:46:41,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 18:46:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:41,128 INFO L225 Difference]: With dead ends: 411 [2019-12-27 18:46:41,128 INFO L226 Difference]: Without dead ends: 379 [2019-12-27 18:46:41,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:46:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-27 18:46:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-27 18:46:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 18:46:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-27 18:46:41,135 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 54 [2019-12-27 18:46:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:41,135 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-27 18:46:41,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:46:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-27 18:46:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:41,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:41,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:41,137 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-12-27 18:46:41,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:41,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176777461] [2019-12-27 18:46:41,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:41,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:46:41,253 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:46:41,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2483~0.base_19| 4)) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19| 1)) (= 0 |v_ULTIMATE.start_main_~#t2483~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19|)) (= 0 v_~x$w_buff1~0_200) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19|) |v_ULTIMATE.start_main_~#t2483~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2483~0.base_19|) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_~#t2483~0.base=|v_ULTIMATE.start_main_~#t2483~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_20|, ULTIMATE.start_main_~#t2483~0.offset=|v_ULTIMATE.start_main_~#t2483~0.offset_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2484~0.offset, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t2483~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2483~0.offset, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:46:41,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2484~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2484~0.offset_9|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2484~0.base_10|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10|) |v_ULTIMATE.start_main_~#t2484~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_10|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2484~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 18:46:41,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= ~x$w_buff0~0_In-1960925397 ~x$w_buff1~0_Out-1960925397) (= ~x$w_buff1_used~0_Out-1960925397 ~x$w_buff0_used~0_In-1960925397) (= |P1Thread1of1ForFork1_#in~arg.base_In-1960925397| P1Thread1of1ForFork1_~arg.base_Out-1960925397) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1960925397| 1) (= 2 ~x$w_buff0~0_Out-1960925397) (= ~x$w_buff0_used~0_Out-1960925397 1) (= (mod ~x$w_buff1_used~0_Out-1960925397 256) 0) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1960925397| P1Thread1of1ForFork1_~arg.offset_Out-1960925397) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1960925397| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1960925397)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1960925397, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1960925397|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1960925397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960925397} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1960925397, ~x$w_buff0~0=~x$w_buff0~0_Out-1960925397, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1960925397, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1960925397|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1960925397, ~x$w_buff1~0=~x$w_buff1~0_Out-1960925397, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1960925397|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1960925397|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1960925397, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1960925397} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:46:41,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-116536008 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-116536008 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-116536008| |P0Thread1of1ForFork0_#t~ite4_Out-116536008|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-116536008| ~x$w_buff1~0_In-116536008)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-116536008| ~x~0_In-116536008) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-116536008, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-116536008, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-116536008, ~x~0=~x~0_In-116536008} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-116536008|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-116536008|, ~x$w_buff1~0=~x$w_buff1~0_In-116536008, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-116536008, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-116536008, ~x~0=~x~0_In-116536008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 18:46:41,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In570552776 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In570552776 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out570552776| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In570552776 |P1Thread1of1ForFork1_#t~ite11_Out570552776|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570552776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570552776} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out570552776|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570552776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570552776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:46:41,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In569868464 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In569868464 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out569868464| ~x$w_buff0_used~0_In569868464) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out569868464| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In569868464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In569868464} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out569868464|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In569868464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In569868464} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:46:41,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2095444268 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-2095444268 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-2095444268 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-2095444268 256)))) (or (and (= ~x$w_buff1_used~0_In-2095444268 |P0Thread1of1ForFork0_#t~ite6_Out-2095444268|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2095444268|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2095444268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2095444268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2095444268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2095444268} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2095444268|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2095444268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2095444268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2095444268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2095444268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:46:41,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-115851850 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-115851850 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-115851850| 0)) (and (= ~x$r_buff0_thd1~0_In-115851850 |P0Thread1of1ForFork0_#t~ite7_Out-115851850|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-115851850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115851850} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-115851850, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-115851850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115851850} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 18:46:41,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1381657299 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1381657299 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1381657299 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1381657299 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1381657299| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1381657299| ~x$r_buff1_thd1~0_In-1381657299)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1381657299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381657299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1381657299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381657299} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1381657299, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1381657299|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381657299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1381657299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381657299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:46:41,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 18:46:41,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2134062698 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2134062698 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2134062698 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-2134062698 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-2134062698| 0)) (and (= ~x$w_buff1_used~0_In-2134062698 |P1Thread1of1ForFork1_#t~ite12_Out-2134062698|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2134062698, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2134062698, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134062698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134062698} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2134062698, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2134062698, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2134062698|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134062698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134062698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:46:41,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-766089661 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-766089661 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-766089661) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-766089661 ~x$r_buff0_thd2~0_Out-766089661)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766089661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766089661} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-766089661|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-766089661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766089661} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:46:41,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1891281984 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1891281984 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1891281984 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1891281984 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1891281984| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-1891281984| ~x$r_buff1_thd2~0_In-1891281984) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1891281984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1891281984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1891281984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1891281984} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1891281984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1891281984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1891281984, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1891281984|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1891281984} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:46:41,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:46:41,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:46:41,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-591177076 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-591177076 256) 0))) (or (and (= ~x~0_In-591177076 |ULTIMATE.start_main_#t~ite17_Out-591177076|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-591177076 |ULTIMATE.start_main_#t~ite17_Out-591177076|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-591177076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-591177076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-591177076, ~x~0=~x~0_In-591177076} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-591177076|, ~x$w_buff1~0=~x$w_buff1~0_In-591177076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-591177076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-591177076, ~x~0=~x~0_In-591177076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 18:46:41,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 18:46:41,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1161399998 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1161399998 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1161399998 |ULTIMATE.start_main_#t~ite19_Out-1161399998|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1161399998|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1161399998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161399998} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1161399998, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1161399998|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161399998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:46:41,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1136117667 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1136117667 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1136117667 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1136117667 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out1136117667| ~x$w_buff1_used~0_In1136117667)) (and (= |ULTIMATE.start_main_#t~ite20_Out1136117667| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1136117667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1136117667, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1136117667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136117667} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1136117667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1136117667, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1136117667|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1136117667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136117667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:46:41,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1313801143 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1313801143 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1313801143| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-1313801143 |ULTIMATE.start_main_#t~ite21_Out-1313801143|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1313801143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1313801143} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1313801143, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1313801143|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1313801143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:46:41,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1947577741 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1947577741 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1947577741 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1947577741 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1947577741 |ULTIMATE.start_main_#t~ite22_Out1947577741|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite22_Out1947577741| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1947577741, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1947577741, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1947577741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1947577741} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1947577741, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1947577741, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1947577741, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1947577741|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1947577741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:46:41,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-927511798 256) 0))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In-927511798 |ULTIMATE.start_main_#t~ite38_Out-927511798|) (= |ULTIMATE.start_main_#t~ite37_In-927511798| |ULTIMATE.start_main_#t~ite37_Out-927511798|)) (and (= |ULTIMATE.start_main_#t~ite37_Out-927511798| |ULTIMATE.start_main_#t~ite38_Out-927511798|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-927511798 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-927511798 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-927511798 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-927511798 256))))) (= ~x$w_buff1_used~0_In-927511798 |ULTIMATE.start_main_#t~ite37_Out-927511798|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-927511798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-927511798, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-927511798|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-927511798, ~weak$$choice2~0=~weak$$choice2~0_In-927511798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-927511798} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-927511798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-927511798, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-927511798|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-927511798|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-927511798, ~weak$$choice2~0=~weak$$choice2~0_In-927511798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-927511798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 18:46:41,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 18:46:41,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:46:41,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:46:41,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:46:41 BasicIcfg [2019-12-27 18:46:41,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:46:41,360 INFO L168 Benchmark]: Toolchain (without parser) took 16783.80 ms. Allocated memory was 146.3 MB in the beginning and 601.4 MB in the end (delta: 455.1 MB). Free memory was 101.8 MB in the beginning and 280.5 MB in the end (delta: -178.6 MB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,361 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 158.4 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,366 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,368 INFO L168 Benchmark]: RCFGBuilder took 796.53 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,369 INFO L168 Benchmark]: TraceAbstraction took 15056.09 ms. Allocated memory was 203.9 MB in the beginning and 601.4 MB in the end (delta: 397.4 MB). Free memory was 109.1 MB in the beginning and 280.5 MB in the end (delta: -171.4 MB). Peak memory consumption was 226.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:41,379 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 158.4 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.67 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.53 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15056.09 ms. Allocated memory was 203.9 MB in the beginning and 601.4 MB in the end (delta: 397.4 MB). Free memory was 109.1 MB in the beginning and 280.5 MB in the end (delta: -171.4 MB). Peak memory consumption was 226.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1173 SDtfs, 1557 SDslu, 3218 SDs, 0 SdLazy, 2292 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11787occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2750 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 80938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...