/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:21:01,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:21:01,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:21:01,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:21:01,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:21:01,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:21:01,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:21:01,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:21:01,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:21:01,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:21:01,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:21:01,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:21:01,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:21:01,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:21:01,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:21:01,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:21:01,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:21:01,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:21:01,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:21:01,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:21:01,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:21:01,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:21:01,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:21:01,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:21:01,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:21:01,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:21:01,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:21:01,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:21:01,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:21:01,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:21:01,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:21:01,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:21:01,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:21:01,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:21:01,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:21:01,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:21:01,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:21:01,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:21:01,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:21:01,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:21:01,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:21:01,143 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-VariableLbe.epf [2019-12-27 07:21:01,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:21:01,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:21:01,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:21:01,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:21:01,172 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:21:01,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:21:01,173 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:21:01,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:21:01,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:21:01,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:21:01,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:21:01,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:21:01,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:21:01,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:21:01,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:21:01,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:21:01,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:21:01,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:21:01,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:21:01,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:21:01,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:21:01,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:21:01,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:21:01,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:21:01,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:21:01,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:21:01,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:21:01,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:21:01,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:21:01,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:21:01,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:21:01,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:21:01,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:21:01,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:21:01,510 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:21:01,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2019-12-27 07:21:01,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdccbdfc4/073b7e96412847ec8c917a812ddbb235/FLAG77523d9d7 [2019-12-27 07:21:02,160 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:21:02,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2019-12-27 07:21:02,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdccbdfc4/073b7e96412847ec8c917a812ddbb235/FLAG77523d9d7 [2019-12-27 07:21:02,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdccbdfc4/073b7e96412847ec8c917a812ddbb235 [2019-12-27 07:21:02,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:21:02,409 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:21:02,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:21:02,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:21:02,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:21:02,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:02" (1/1) ... [2019-12-27 07:21:02,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778a9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:02, skipping insertion in model container [2019-12-27 07:21:02,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:02" (1/1) ... [2019-12-27 07:21:02,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:21:02,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:21:02,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:21:03,012 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:21:03,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:21:03,217 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:21:03,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03 WrapperNode [2019-12-27 07:21:03,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:21:03,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:21:03,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:21:03,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:21:03,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:21:03,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:21:03,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:21:03,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:21:03,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (1/1) ... [2019-12-27 07:21:03,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:21:03,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:21:03,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:21:03,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:21:03,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (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 07:21:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:21:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:21:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:21:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:21:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:21:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:21:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:21:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:21:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:21:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:21:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:21:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:21:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:21:03,393 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 07:21:04,161 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:21:04,161 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:21:04,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:04 BoogieIcfgContainer [2019-12-27 07:21:04,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:21:04,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:21:04,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:21:04,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:21:04,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:21:02" (1/3) ... [2019-12-27 07:21:04,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556f1a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:04, skipping insertion in model container [2019-12-27 07:21:04,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:03" (2/3) ... [2019-12-27 07:21:04,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556f1a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:04, skipping insertion in model container [2019-12-27 07:21:04,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:04" (3/3) ... [2019-12-27 07:21:04,172 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2019-12-27 07:21:04,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:21:04,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:21:04,191 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:21:04,192 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:21:04,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:21:04,333 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:21:04,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:21:04,351 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:21:04,351 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:21:04,351 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:21:04,351 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:21:04,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:21:04,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:21:04,352 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:21:04,368 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:21:04,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:21:04,473 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:21:04,473 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:21:04,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:21:04,511 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:21:04,565 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:21:04,565 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:21:04,573 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:21:04,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 07:21:04,594 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:21:07,924 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:21:08,053 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:21:08,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-27 07:21:08,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 07:21:08,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 07:21:28,771 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 07:21:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 07:21:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:21:28,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:28,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:21:28,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-27 07:21:28,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:28,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350510515] [2019-12-27 07:21:28,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:29,065 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 07:21:29,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350510515] [2019-12-27 07:21:29,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:29,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:21:29,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779759516] [2019-12-27 07:21:29,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:21:29,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:21:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:21:29,085 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 07:21:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:32,950 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 07:21:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:21:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:21:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:33,744 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 07:21:33,744 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 07:21:33,746 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 07:21:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 07:21:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 07:21:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 07:21:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 07:21:47,325 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 07:21:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:47,325 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 07:21:47,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:21:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 07:21:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:21:47,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:47,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:47,329 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-27 07:21:47,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:47,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848922872] [2019-12-27 07:21:47,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:47,442 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 07:21:47,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848922872] [2019-12-27 07:21:47,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:47,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:21:47,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888801968] [2019-12-27 07:21:47,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:21:47,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:21:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:21:47,446 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 07:21:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:48,681 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 07:21:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:21:48,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:21:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:54,417 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 07:21:54,418 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 07:21:54,419 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 07:21:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 07:22:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 07:22:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 07:22:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 07:22:09,129 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 07:22:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:09,130 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 07:22:09,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:22:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 07:22:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:22:09,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:09,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:09,139 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-27 07:22:09,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:09,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475097195] [2019-12-27 07:22:09,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:09,261 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 07:22:09,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475097195] [2019-12-27 07:22:09,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:09,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:09,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482060115] [2019-12-27 07:22:09,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:22:09,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:22:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:22:09,263 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 07:22:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:12,150 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 07:22:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:22:12,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:22:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:13,106 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 07:22:13,106 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 07:22:13,106 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 07:22:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 07:22:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 07:22:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 07:22:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 07:22:31,432 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 07:22:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:31,433 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 07:22:31,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:22:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 07:22:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:22:31,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:31,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:31,436 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-27 07:22:31,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:31,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828045642] [2019-12-27 07:22:31,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:31,486 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 07:22:31,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828045642] [2019-12-27 07:22:31,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:31,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:31,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173276517] [2019-12-27 07:22:31,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:31,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:31,488 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 07:22:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:31,622 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 07:22:31,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:31,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:22:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:31,714 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 07:22:31,715 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 07:22:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 07:22:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 07:22:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 07:22:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 07:22:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 07:22:38,054 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 07:22:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:38,055 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 07:22:38,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 07:22:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:22:38,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:38,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:38,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-27 07:22:38,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:38,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923243855] [2019-12-27 07:22:38,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:38,168 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 07:22:38,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923243855] [2019-12-27 07:22:38,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:38,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:22:38,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280825196] [2019-12-27 07:22:38,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:22:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:22:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:22:38,171 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-27 07:22:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:39,012 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-27 07:22:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:22:39,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:22:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:39,101 INFO L225 Difference]: With dead ends: 53752 [2019-12-27 07:22:39,102 INFO L226 Difference]: Without dead ends: 53739 [2019-12-27 07:22:39,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:22:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-27 07:22:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-27 07:22:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 07:22:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 07:22:40,282 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 07:22:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 07:22:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:22:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 07:22:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:22:40,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:40,294 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] [2019-12-27 07:22:40,294 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-27 07:22:40,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:40,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279375061] [2019-12-27 07:22:40,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:40,389 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 07:22:40,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279375061] [2019-12-27 07:22:40,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:40,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:22:40,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104475196] [2019-12-27 07:22:40,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:22:40,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:40,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:22:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:22:40,393 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-27 07:22:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:40,435 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 07:22:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:22:40,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:22:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:40,444 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 07:22:40,444 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 07:22:40,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:22:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 07:22:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 07:22:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 07:22:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 07:22:40,536 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 07:22:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:40,536 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 07:22:40,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:22:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 07:22:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:22:40,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:40,547 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] [2019-12-27 07:22:40,547 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-27 07:22:40,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:40,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683609169] [2019-12-27 07:22:40,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:40,631 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 07:22:40,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683609169] [2019-12-27 07:22:40,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:40,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:22:40,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451763574] [2019-12-27 07:22:40,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:22:40,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:22:40,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:22:40,634 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 07:22:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:40,675 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 07:22:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:22:40,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:22:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:40,683 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 07:22:40,683 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 07:22:40,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:22:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 07:22:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 07:22:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 07:22:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 07:22:40,759 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 07:22:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 07:22:40,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:22:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 07:22:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:22:40,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:40,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:40,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-27 07:22:40,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:40,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841897986] [2019-12-27 07:22:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:40,839 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 07:22:40,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841897986] [2019-12-27 07:22:40,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:40,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:22:40,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236500063] [2019-12-27 07:22:40,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:40,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:40,841 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 07:22:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:40,902 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 07:22:40,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:40,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:22:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:40,909 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:22:40,909 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:22:40,909 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 07:22:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:22:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:22:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:22:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 07:22:40,972 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 07:22:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:40,973 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 07:22:40,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 07:22:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:22:40,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:40,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:40,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-27 07:22:40,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:40,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260565271] [2019-12-27 07:22:40,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:41,053 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 07:22:41,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260565271] [2019-12-27 07:22:41,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:41,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:22:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575734748] [2019-12-27 07:22:41,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:41,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:41,056 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 07:22:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:41,119 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 07:22:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:41,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:22:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:41,129 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:22:41,129 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:22:41,129 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 07:22:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:22:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:22:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:22:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 07:22:41,223 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 07:22:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:41,223 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 07:22:41,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 07:22:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:22:41,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:41,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:41,230 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-27 07:22:41,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:41,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191825847] [2019-12-27 07:22:41,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:41,374 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 07:22:41,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191825847] [2019-12-27 07:22:41,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:41,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:22:41,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321698687] [2019-12-27 07:22:41,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:22:41,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:22:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:22:41,377 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 6 states. [2019-12-27 07:22:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:41,946 INFO L93 Difference]: Finished difference Result 8767 states and 25089 transitions. [2019-12-27 07:22:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:22:41,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:22:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:41,962 INFO L225 Difference]: With dead ends: 8767 [2019-12-27 07:22:41,962 INFO L226 Difference]: Without dead ends: 8767 [2019-12-27 07:22:41,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:22:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2019-12-27 07:22:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 5422. [2019-12-27 07:22:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-12-27 07:22:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 15669 transitions. [2019-12-27 07:22:42,071 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 15669 transitions. Word has length 65 [2019-12-27 07:22:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:42,072 INFO L462 AbstractCegarLoop]: Abstraction has 5422 states and 15669 transitions. [2019-12-27 07:22:42,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:22:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 15669 transitions. [2019-12-27 07:22:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:22:42,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:42,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:42,080 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2057570235, now seen corresponding path program 2 times [2019-12-27 07:22:42,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:42,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145438633] [2019-12-27 07:22:42,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:42,194 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 07:22:42,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145438633] [2019-12-27 07:22:42,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:42,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:22:42,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123410104] [2019-12-27 07:22:42,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:22:42,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:22:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:22:42,196 INFO L87 Difference]: Start difference. First operand 5422 states and 15669 transitions. Second operand 5 states. [2019-12-27 07:22:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:42,554 INFO L93 Difference]: Finished difference Result 7982 states and 22732 transitions. [2019-12-27 07:22:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:22:42,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:22:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:42,566 INFO L225 Difference]: With dead ends: 7982 [2019-12-27 07:22:42,566 INFO L226 Difference]: Without dead ends: 7982 [2019-12-27 07:22:42,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:22:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2019-12-27 07:22:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 5924. [2019-12-27 07:22:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-12-27 07:22:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 17161 transitions. [2019-12-27 07:22:42,661 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 17161 transitions. Word has length 65 [2019-12-27 07:22:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:42,661 INFO L462 AbstractCegarLoop]: Abstraction has 5924 states and 17161 transitions. [2019-12-27 07:22:42,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:22:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 17161 transitions. [2019-12-27 07:22:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:22:42,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:42,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:42,670 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1243942585, now seen corresponding path program 3 times [2019-12-27 07:22:42,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:42,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833167872] [2019-12-27 07:22:42,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:42,735 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 07:22:42,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833167872] [2019-12-27 07:22:42,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:42,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:42,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542106567] [2019-12-27 07:22:42,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:42,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:42,738 INFO L87 Difference]: Start difference. First operand 5924 states and 17161 transitions. Second operand 3 states. [2019-12-27 07:22:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:42,768 INFO L93 Difference]: Finished difference Result 5120 states and 14580 transitions. [2019-12-27 07:22:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:42,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:22:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:42,776 INFO L225 Difference]: With dead ends: 5120 [2019-12-27 07:22:42,776 INFO L226 Difference]: Without dead ends: 5120 [2019-12-27 07:22:42,777 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 07:22:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2019-12-27 07:22:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 4840. [2019-12-27 07:22:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2019-12-27 07:22:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13808 transitions. [2019-12-27 07:22:42,883 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 13808 transitions. Word has length 65 [2019-12-27 07:22:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:42,883 INFO L462 AbstractCegarLoop]: Abstraction has 4840 states and 13808 transitions. [2019-12-27 07:22:42,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 13808 transitions. [2019-12-27 07:22:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:22:43,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:43,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:43,104 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682329, now seen corresponding path program 1 times [2019-12-27 07:22:43,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:43,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531363205] [2019-12-27 07:22:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:43,251 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 07:22:43,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531363205] [2019-12-27 07:22:43,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:43,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:22:43,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521531046] [2019-12-27 07:22:43,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:22:43,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:22:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:22:43,254 INFO L87 Difference]: Start difference. First operand 4840 states and 13808 transitions. Second operand 6 states. [2019-12-27 07:22:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:43,740 INFO L93 Difference]: Finished difference Result 7012 states and 19685 transitions. [2019-12-27 07:22:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:22:43,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:22:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:43,751 INFO L225 Difference]: With dead ends: 7012 [2019-12-27 07:22:43,751 INFO L226 Difference]: Without dead ends: 7012 [2019-12-27 07:22:43,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:22:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-12-27 07:22:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 5533. [2019-12-27 07:22:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5533 states. [2019-12-27 07:22:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 15753 transitions. [2019-12-27 07:22:43,881 INFO L78 Accepts]: Start accepts. Automaton has 5533 states and 15753 transitions. Word has length 66 [2019-12-27 07:22:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:43,882 INFO L462 AbstractCegarLoop]: Abstraction has 5533 states and 15753 transitions. [2019-12-27 07:22:43,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:22:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5533 states and 15753 transitions. [2019-12-27 07:22:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:22:43,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:43,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:43,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash -710018751, now seen corresponding path program 2 times [2019-12-27 07:22:43,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:43,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828441045] [2019-12-27 07:22:43,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:44,006 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 07:22:44,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828441045] [2019-12-27 07:22:44,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:44,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:22:44,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621994171] [2019-12-27 07:22:44,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:22:44,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:22:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:22:44,009 INFO L87 Difference]: Start difference. First operand 5533 states and 15753 transitions. Second operand 6 states. [2019-12-27 07:22:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:44,570 INFO L93 Difference]: Finished difference Result 7599 states and 21224 transitions. [2019-12-27 07:22:44,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:22:44,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:22:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:44,583 INFO L225 Difference]: With dead ends: 7599 [2019-12-27 07:22:44,584 INFO L226 Difference]: Without dead ends: 7599 [2019-12-27 07:22:44,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:22:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2019-12-27 07:22:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 5932. [2019-12-27 07:22:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5932 states. [2019-12-27 07:22:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5932 states to 5932 states and 16732 transitions. [2019-12-27 07:22:44,727 INFO L78 Accepts]: Start accepts. Automaton has 5932 states and 16732 transitions. Word has length 66 [2019-12-27 07:22:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:44,727 INFO L462 AbstractCegarLoop]: Abstraction has 5932 states and 16732 transitions. [2019-12-27 07:22:44,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:22:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5932 states and 16732 transitions. [2019-12-27 07:22:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:22:44,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:44,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:44,740 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:44,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash -397995211, now seen corresponding path program 3 times [2019-12-27 07:22:44,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:44,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593096105] [2019-12-27 07:22:44,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:44,879 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 07:22:44,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593096105] [2019-12-27 07:22:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:44,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:22:44,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935342281] [2019-12-27 07:22:44,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:22:44,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:22:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:22:44,882 INFO L87 Difference]: Start difference. First operand 5932 states and 16732 transitions. Second operand 7 states. [2019-12-27 07:22:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:45,641 INFO L93 Difference]: Finished difference Result 8663 states and 24095 transitions. [2019-12-27 07:22:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:22:45,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:22:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:45,653 INFO L225 Difference]: With dead ends: 8663 [2019-12-27 07:22:45,653 INFO L226 Difference]: Without dead ends: 8663 [2019-12-27 07:22:45,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:22:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2019-12-27 07:22:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 5848. [2019-12-27 07:22:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5848 states. [2019-12-27 07:22:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5848 states to 5848 states and 16506 transitions. [2019-12-27 07:22:45,753 INFO L78 Accepts]: Start accepts. Automaton has 5848 states and 16506 transitions. Word has length 66 [2019-12-27 07:22:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:45,753 INFO L462 AbstractCegarLoop]: Abstraction has 5848 states and 16506 transitions. [2019-12-27 07:22:45,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:22:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 16506 transitions. [2019-12-27 07:22:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:22:45,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:45,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:45,761 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1480872019, now seen corresponding path program 4 times [2019-12-27 07:22:45,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:45,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743290775] [2019-12-27 07:22:45,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:45,827 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 07:22:45,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743290775] [2019-12-27 07:22:45,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:45,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:45,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651368984] [2019-12-27 07:22:45,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:45,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:45,829 INFO L87 Difference]: Start difference. First operand 5848 states and 16506 transitions. Second operand 3 states. [2019-12-27 07:22:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:45,890 INFO L93 Difference]: Finished difference Result 5848 states and 16505 transitions. [2019-12-27 07:22:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:45,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:22:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:45,899 INFO L225 Difference]: With dead ends: 5848 [2019-12-27 07:22:45,900 INFO L226 Difference]: Without dead ends: 5848 [2019-12-27 07:22:45,900 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 07:22:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2019-12-27 07:22:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 3667. [2019-12-27 07:22:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3667 states. [2019-12-27 07:22:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 10478 transitions. [2019-12-27 07:22:45,998 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 10478 transitions. Word has length 66 [2019-12-27 07:22:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:45,999 INFO L462 AbstractCegarLoop]: Abstraction has 3667 states and 10478 transitions. [2019-12-27 07:22:45,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 10478 transitions. [2019-12-27 07:22:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:22:46,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:46,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:46,008 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1093252188, now seen corresponding path program 1 times [2019-12-27 07:22:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:46,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697066874] [2019-12-27 07:22:46,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:46,099 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 07:22:46,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697066874] [2019-12-27 07:22:46,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:46,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:46,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061033711] [2019-12-27 07:22:46,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:46,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:46,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:46,103 INFO L87 Difference]: Start difference. First operand 3667 states and 10478 transitions. Second operand 3 states. [2019-12-27 07:22:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:46,129 INFO L93 Difference]: Finished difference Result 3477 states and 9750 transitions. [2019-12-27 07:22:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:46,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:22:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:46,137 INFO L225 Difference]: With dead ends: 3477 [2019-12-27 07:22:46,138 INFO L226 Difference]: Without dead ends: 3477 [2019-12-27 07:22:46,138 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 07:22:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2019-12-27 07:22:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3263. [2019-12-27 07:22:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3263 states. [2019-12-27 07:22:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 9152 transitions. [2019-12-27 07:22:46,238 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 9152 transitions. Word has length 67 [2019-12-27 07:22:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:46,238 INFO L462 AbstractCegarLoop]: Abstraction has 3263 states and 9152 transitions. [2019-12-27 07:22:46,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 9152 transitions. [2019-12-27 07:22:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:22:46,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:46,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:46,246 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -359570990, now seen corresponding path program 1 times [2019-12-27 07:22:46,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:46,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105366978] [2019-12-27 07:22:46,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:46,406 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 07:22:46,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105366978] [2019-12-27 07:22:46,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:46,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:22:46,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996317931] [2019-12-27 07:22:46,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:22:46,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:22:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:22:46,408 INFO L87 Difference]: Start difference. First operand 3263 states and 9152 transitions. Second operand 6 states. [2019-12-27 07:22:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:46,558 INFO L93 Difference]: Finished difference Result 5630 states and 15788 transitions. [2019-12-27 07:22:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:22:46,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 07:22:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:46,565 INFO L225 Difference]: With dead ends: 5630 [2019-12-27 07:22:46,565 INFO L226 Difference]: Without dead ends: 2858 [2019-12-27 07:22:46,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:22:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-12-27 07:22:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2477. [2019-12-27 07:22:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-12-27 07:22:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 6882 transitions. [2019-12-27 07:22:46,656 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 6882 transitions. Word has length 68 [2019-12-27 07:22:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:46,656 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 6882 transitions. [2019-12-27 07:22:46,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:22:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 6882 transitions. [2019-12-27 07:22:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:22:46,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:46,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:46,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1765765328, now seen corresponding path program 2 times [2019-12-27 07:22:46,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:46,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290895012] [2019-12-27 07:22:46,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:46,820 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 07:22:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290895012] [2019-12-27 07:22:46,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:46,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:22:46,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775518419] [2019-12-27 07:22:46,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:22:46,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:22:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:22:46,823 INFO L87 Difference]: Start difference. First operand 2477 states and 6882 transitions. Second operand 6 states. [2019-12-27 07:22:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:46,906 INFO L93 Difference]: Finished difference Result 4462 states and 12419 transitions. [2019-12-27 07:22:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:22:46,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 07:22:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:46,910 INFO L225 Difference]: With dead ends: 4462 [2019-12-27 07:22:46,910 INFO L226 Difference]: Without dead ends: 2153 [2019-12-27 07:22:46,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:22:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2019-12-27 07:22:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2153. [2019-12-27 07:22:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-27 07:22:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 6004 transitions. [2019-12-27 07:22:46,960 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 6004 transitions. Word has length 68 [2019-12-27 07:22:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:46,960 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 6004 transitions. [2019-12-27 07:22:46,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:22:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 6004 transitions. [2019-12-27 07:22:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:22:46,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:46,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:46,964 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:22:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 3 times [2019-12-27 07:22:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:46,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863201330] [2019-12-27 07:22:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:22:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:22:47,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:22:47,113 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:22:47,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~y~0_14 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1816~0.base_20|) 0) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1816~0.offset_17|) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1816~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1816~0.base_20|) |v_ULTIMATE.start_main_~#t1816~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd2~0_19 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1816~0.base_20| 4) |v_#length_25|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1816~0.base_20|) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1816~0.base_20| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_~#t1818~0.offset=|v_ULTIMATE.start_main_~#t1818~0.offset_16|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_~#t1816~0.offset=|v_ULTIMATE.start_main_~#t1816~0.offset_17|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_~#t1817~0.base=|v_ULTIMATE.start_main_~#t1817~0.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1816~0.base=|v_ULTIMATE.start_main_~#t1816~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_~#t1817~0.offset=|v_ULTIMATE.start_main_~#t1817~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t1818~0.base=|v_ULTIMATE.start_main_~#t1818~0.base_20|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1818~0.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1816~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1817~0.base, ~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~ite33, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t1816~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1817~0.offset, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1818~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, 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, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:22:47,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1817~0.base_11| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1817~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1817~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1817~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1817~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1817~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1817~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1817~0.base_11|) |v_ULTIMATE.start_main_~#t1817~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t1817~0.offset=|v_ULTIMATE.start_main_~#t1817~0.offset_10|, ULTIMATE.start_main_~#t1817~0.base=|v_ULTIMATE.start_main_~#t1817~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1817~0.offset, ULTIMATE.start_main_~#t1817~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:22:47,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1818~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1818~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1818~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1818~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1818~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1818~0.base_9|) |v_ULTIMATE.start_main_~#t1818~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1818~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1818~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1818~0.offset=|v_ULTIMATE.start_main_~#t1818~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1818~0.base=|v_ULTIMATE.start_main_~#t1818~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1818~0.offset, #length, ULTIMATE.start_main_~#t1818~0.base] because there is no mapped edge [2019-12-27 07:22:47,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} 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 07:22:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-363160722 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-363160722 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-363160722| ~x$w_buff1~0_In-363160722) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-363160722| ~x~0_In-363160722) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-363160722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-363160722, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-363160722, ~x~0=~x~0_In-363160722} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-363160722|, ~x$w_buff1~0=~x$w_buff1~0_In-363160722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-363160722, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-363160722, ~x~0=~x~0_In-363160722} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:22:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 07:22:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1072726337 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1072726337 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1072726337| ~x$w_buff0_used~0_In1072726337)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1072726337| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1072726337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1072726337} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1072726337, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1072726337|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1072726337} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:22:47,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In383084508 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In383084508 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In383084508 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In383084508 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out383084508| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out383084508| ~x$w_buff1_used~0_In383084508) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In383084508, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In383084508, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In383084508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In383084508} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In383084508, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In383084508, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In383084508, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out383084508|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In383084508} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:22:47,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In185252974 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out185252974| |P0Thread1of1ForFork0_#t~ite3_Out185252974|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In185252974 256)))) (or (and (= ~x~0_In185252974 |P0Thread1of1ForFork0_#t~ite3_Out185252974|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In185252974 |P0Thread1of1ForFork0_#t~ite3_Out185252974|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In185252974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185252974, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In185252974, ~x~0=~x~0_In185252974} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out185252974|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out185252974|, ~x$w_buff1~0=~x$w_buff1~0_In185252974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185252974, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In185252974, ~x~0=~x~0_In185252974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:22:47,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In356220281 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In356220281 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In356220281 |P0Thread1of1ForFork0_#t~ite5_Out356220281|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out356220281|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In356220281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356220281} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out356220281|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In356220281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356220281} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:22:47,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1571881541 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1571881541 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1571881541 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1571881541 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1571881541|)) (and (= ~x$w_buff1_used~0_In1571881541 |P0Thread1of1ForFork0_#t~ite6_Out1571881541|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1571881541, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1571881541, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1571881541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1571881541} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1571881541|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1571881541, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1571881541, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1571881541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1571881541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:22:47,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1850809648 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1850809648 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1850809648| ~x$r_buff0_thd3~0_In-1850809648) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1850809648| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1850809648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1850809648, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1850809648|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:22:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-139737811 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-139737811 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-139737811 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-139737811 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-139737811| ~x$r_buff1_thd3~0_In-139737811) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out-139737811| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-139737811, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-139737811, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-139737811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139737811} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-139737811|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-139737811, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-139737811, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-139737811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139737811} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:22:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:22:47,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-83935295 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-83935295 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-83935295|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-83935295 |P0Thread1of1ForFork0_#t~ite7_Out-83935295|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83935295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83935295} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83935295, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-83935295|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83935295} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:22:47,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1304621756 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1304621756 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1304621756 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1304621756 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1304621756| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1304621756| ~x$r_buff1_thd1~0_In1304621756)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1304621756, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1304621756, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1304621756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1304621756, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1304621756|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1304621756, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1304621756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:22:47,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} 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 07:22:47,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-206261261 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-206261261 256)))) (or (and (= ~x$w_buff0_used~0_In-206261261 |P1Thread1of1ForFork1_#t~ite11_Out-206261261|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-206261261| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-206261261|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:22:47,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-436117991 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-436117991 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-436117991 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-436117991 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-436117991 |P1Thread1of1ForFork1_#t~ite12_Out-436117991|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-436117991|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-436117991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-436117991, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-436117991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-436117991} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-436117991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-436117991, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-436117991|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-436117991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-436117991} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:22:47,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1459891929 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1459891929 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1459891929)) (and (= ~x$r_buff0_thd2~0_In-1459891929 ~x$r_buff0_thd2~0_Out-1459891929) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1459891929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1459891929|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1459891929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:22:47,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1433616437 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1433616437 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1433616437 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1433616437 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1433616437|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-1433616437 |P1Thread1of1ForFork1_#t~ite14_Out-1433616437|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1433616437, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1433616437, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433616437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433616437} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1433616437, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1433616437, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433616437, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1433616437|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433616437} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:22:47,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, 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 07:22:47,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:22:47,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-287655232| |ULTIMATE.start_main_#t~ite24_Out-287655232|)) (.cse2 (= (mod ~x$w_buff1_used~0_In-287655232 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-287655232 256)))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In-287655232 |ULTIMATE.start_main_#t~ite24_Out-287655232|) (not .cse2)) (and (= ~x~0_In-287655232 |ULTIMATE.start_main_#t~ite24_Out-287655232|) .cse0 (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-287655232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-287655232, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-287655232, ~x~0=~x~0_In-287655232} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-287655232, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-287655232|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-287655232|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-287655232, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-287655232, ~x~0=~x~0_In-287655232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:22:47,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1832957228 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1832957228 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1832957228| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1832957228 |ULTIMATE.start_main_#t~ite26_Out-1832957228|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1832957228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1832957228} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1832957228, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1832957228|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1832957228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:22:47,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-729412619 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-729412619 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-729412619 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-729412619 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-729412619|)) (and (= ~x$w_buff1_used~0_In-729412619 |ULTIMATE.start_main_#t~ite27_Out-729412619|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-729412619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729412619, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-729412619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729412619} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-729412619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729412619, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-729412619|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-729412619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729412619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:22:47,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In337790613 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In337790613 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out337790613| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In337790613 |ULTIMATE.start_main_#t~ite28_Out337790613|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In337790613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In337790613} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In337790613, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out337790613|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In337790613} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:22:47,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1587013088 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1587013088 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1587013088 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1587013088 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out1587013088| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite29_Out1587013088| ~x$r_buff1_thd0~0_In1587013088) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1587013088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1587013088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1587013088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1587013088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1587013088, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1587013088|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1587013088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1587013088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1587013088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:22:47,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: 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~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:22:47,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:22:47,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:22:47,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:22:47 BasicIcfg [2019-12-27 07:22:47,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:22:47,259 INFO L168 Benchmark]: Toolchain (without parser) took 104851.45 ms. Allocated memory was 146.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 102.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,260 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.21 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 155.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.61 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,262 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,264 INFO L168 Benchmark]: RCFGBuilder took 836.78 ms. Allocated memory is still 203.4 MB. Free memory was 149.7 MB in the beginning and 99.6 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,264 INFO L168 Benchmark]: TraceAbstraction took 103093.79 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:22:47,267 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.21 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 155.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.61 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.64 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.78 ms. Allocated memory is still 203.4 MB. Free memory was 149.7 MB in the beginning and 99.6 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103093.79 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L807] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L733] 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, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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) [L827] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L827] 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)) [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L828] 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)) [L829] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L829] 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)) [L830] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L830] 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)) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2802 SDtfs, 2087 SDslu, 4740 SDs, 0 SdLazy, 3159 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 42 SyntacticMatches, 15 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 79728 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 983 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 123955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...