/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/rfi001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:15,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:15,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:15,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:15,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:15,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:15,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:15,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:15,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:15,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:15,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:15,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:15,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:15,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:15,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:15,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:15,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:15,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:15,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:15,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:15,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:15,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:15,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:15,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:15,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:15,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:15,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:15,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:15,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:15,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:15,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:15,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:15,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:15,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:15,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:15,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:15,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:15,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:15,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:15,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:15,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:15,217 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:04:15,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:15,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:15,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:15,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:15,245 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:15,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:15,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:15,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:15,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:15,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:15,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:15,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:15,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:15,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:15,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:15,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:15,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:15,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:15,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:15,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:15,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:15,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:15,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:15,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:15,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:15,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:15,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:15,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:15,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:15,588 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:15,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-27 07:04:15,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30e250b5/22c3489553bf482a92f6bb0b9f3871ba/FLAG15ed63362 [2019-12-27 07:04:16,240 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:16,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-27 07:04:16,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30e250b5/22c3489553bf482a92f6bb0b9f3871ba/FLAG15ed63362 [2019-12-27 07:04:16,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30e250b5/22c3489553bf482a92f6bb0b9f3871ba [2019-12-27 07:04:16,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:16,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:16,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:16,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:16,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:16,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16, skipping insertion in model container [2019-12-27 07:04:16,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:16,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:17,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:17,033 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:17,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:17,174 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:17,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17 WrapperNode [2019-12-27 07:04:17,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:17,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:17,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:17,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:17,185 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:04:17" (1/1) ... [2019-12-27 07:04:17,204 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:04:17" (1/1) ... [2019-12-27 07:04:17,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:17,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:17,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:17,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:17,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... [2019-12-27 07:04:17,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:17,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:17,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:17,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:17,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:17,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:17,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:17,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:17,375 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:04:18,122 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:18,122 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:18,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:18 BoogieIcfgContainer [2019-12-27 07:04:18,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:18,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:18,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:18,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:18,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:16" (1/3) ... [2019-12-27 07:04:18,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:18, skipping insertion in model container [2019-12-27 07:04:18,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:17" (2/3) ... [2019-12-27 07:04:18,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:18, skipping insertion in model container [2019-12-27 07:04:18,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:18" (3/3) ... [2019-12-27 07:04:18,137 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2019-12-27 07:04:18,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:18,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:18,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:18,162 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:18,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:18,241 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:18,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:18,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:18,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:18,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:18,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:18,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:18,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:18,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:18,280 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 07:04:18,282 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:18,383 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:18,383 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:18,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:18,417 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:18,461 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:18,462 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:18,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:18,481 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 07:04:18,483 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:21,440 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:21,588 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:04:21,616 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-27 07:04:21,616 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 07:04:21,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:04:22,144 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-27 07:04:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-27 07:04:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:04:22,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:22,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:04:22,155 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-27 07:04:22,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:22,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018552054] [2019-12-27 07:04:22,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,508 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:04:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018552054] [2019-12-27 07:04:22,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154487890] [2019-12-27 07:04:22,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:22,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:22,535 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-27 07:04:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:22,797 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-27 07:04:22,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:22,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:04:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:22,885 INFO L225 Difference]: With dead ends: 9298 [2019-12-27 07:04:22,886 INFO L226 Difference]: Without dead ends: 9116 [2019-12-27 07:04:22,887 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:04:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-27 07:04:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-27 07:04:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 07:04:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-27 07:04:23,422 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-27 07:04:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:23,422 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-27 07:04:23,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-27 07:04:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:23,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:23,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:23,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-27 07:04:23,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:23,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212085392] [2019-12-27 07:04:23,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:23,572 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:04:23,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212085392] [2019-12-27 07:04:23,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:23,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:23,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267795003] [2019-12-27 07:04:23,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:23,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:23,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:23,576 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 4 states. [2019-12-27 07:04:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:23,994 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-27 07:04:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:23,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:04:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:24,081 INFO L225 Difference]: With dead ends: 14491 [2019-12-27 07:04:24,082 INFO L226 Difference]: Without dead ends: 14484 [2019-12-27 07:04:24,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:04:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-27 07:04:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-27 07:04:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-27 07:04:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-27 07:04:25,114 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-27 07:04:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:25,115 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-27 07:04:25,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-27 07:04:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:25,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:25,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:25,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-27 07:04:25,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:25,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350774977] [2019-12-27 07:04:25,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:25,216 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:04:25,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350774977] [2019-12-27 07:04:25,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:25,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:25,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744940686] [2019-12-27 07:04:25,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:25,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:25,219 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-27 07:04:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:25,481 INFO L93 Difference]: Finished difference Result 15862 states and 50069 transitions. [2019-12-27 07:04:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:25,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:04:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:25,525 INFO L225 Difference]: With dead ends: 15862 [2019-12-27 07:04:25,525 INFO L226 Difference]: Without dead ends: 15862 [2019-12-27 07:04:25,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:04:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-12-27 07:04:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14086. [2019-12-27 07:04:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2019-12-27 07:04:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 44814 transitions. [2019-12-27 07:04:26,029 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 44814 transitions. Word has length 11 [2019-12-27 07:04:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 14086 states and 44814 transitions. [2019-12-27 07:04:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 44814 transitions. [2019-12-27 07:04:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:04:26,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:26,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:26,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash -955684775, now seen corresponding path program 1 times [2019-12-27 07:04:26,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:26,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843937571] [2019-12-27 07:04:26,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:26,130 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:04:26,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843937571] [2019-12-27 07:04:26,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:26,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:26,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803723475] [2019-12-27 07:04:26,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:26,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:26,136 INFO L87 Difference]: Start difference. First operand 14086 states and 44814 transitions. Second operand 5 states. [2019-12-27 07:04:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:26,643 INFO L93 Difference]: Finished difference Result 18942 states and 58832 transitions. [2019-12-27 07:04:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:04:26,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:04:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:26,710 INFO L225 Difference]: With dead ends: 18942 [2019-12-27 07:04:26,711 INFO L226 Difference]: Without dead ends: 18935 [2019-12-27 07:04:26,711 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:04:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2019-12-27 07:04:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 13974. [2019-12-27 07:04:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2019-12-27 07:04:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 44317 transitions. [2019-12-27 07:04:27,316 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 44317 transitions. Word has length 17 [2019-12-27 07:04:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:27,316 INFO L462 AbstractCegarLoop]: Abstraction has 13974 states and 44317 transitions. [2019-12-27 07:04:27,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 44317 transitions. [2019-12-27 07:04:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:27,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:27,338 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:04:27,339 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1822059607, now seen corresponding path program 1 times [2019-12-27 07:04:27,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:27,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334696379] [2019-12-27 07:04:27,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:27,431 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:04:27,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334696379] [2019-12-27 07:04:27,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:27,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:27,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394560311] [2019-12-27 07:04:27,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:27,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:27,434 INFO L87 Difference]: Start difference. First operand 13974 states and 44317 transitions. Second operand 3 states. [2019-12-27 07:04:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:27,546 INFO L93 Difference]: Finished difference Result 17027 states and 54294 transitions. [2019-12-27 07:04:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:27,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:04:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:27,593 INFO L225 Difference]: With dead ends: 17027 [2019-12-27 07:04:27,593 INFO L226 Difference]: Without dead ends: 17027 [2019-12-27 07:04:27,594 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:04:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2019-12-27 07:04:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 16072. [2019-12-27 07:04:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-12-27 07:04:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 51443 transitions. [2019-12-27 07:04:28,773 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 51443 transitions. Word has length 25 [2019-12-27 07:04:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,775 INFO L462 AbstractCegarLoop]: Abstraction has 16072 states and 51443 transitions. [2019-12-27 07:04:28,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 51443 transitions. [2019-12-27 07:04:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:28,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,794 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:04:28,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1659519911, now seen corresponding path program 1 times [2019-12-27 07:04:28,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351527161] [2019-12-27 07:04:28,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:28,892 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:04:28,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351527161] [2019-12-27 07:04:28,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:28,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:28,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327294271] [2019-12-27 07:04:28,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:28,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:28,895 INFO L87 Difference]: Start difference. First operand 16072 states and 51443 transitions. Second operand 4 states. [2019-12-27 07:04:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:28,942 INFO L93 Difference]: Finished difference Result 2493 states and 5802 transitions. [2019-12-27 07:04:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:04:28,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:04:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:28,948 INFO L225 Difference]: With dead ends: 2493 [2019-12-27 07:04:28,948 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 07:04:28,949 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:04:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 07:04:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-27 07:04:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-27 07:04:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5011 transitions. [2019-12-27 07:04:28,998 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5011 transitions. Word has length 25 [2019-12-27 07:04:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,999 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 5011 transitions. [2019-12-27 07:04:28,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5011 transitions. [2019-12-27 07:04:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:04:29,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:29,005 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:04:29,005 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1180281911, now seen corresponding path program 1 times [2019-12-27 07:04:29,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:29,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193144914] [2019-12-27 07:04:29,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:29,111 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:04:29,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193144914] [2019-12-27 07:04:29,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:29,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:04:29,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979786157] [2019-12-27 07:04:29,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:29,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:29,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:29,114 INFO L87 Difference]: Start difference. First operand 2207 states and 5011 transitions. Second operand 5 states. [2019-12-27 07:04:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:29,171 INFO L93 Difference]: Finished difference Result 431 states and 787 transitions. [2019-12-27 07:04:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:29,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:04:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:29,173 INFO L225 Difference]: With dead ends: 431 [2019-12-27 07:04:29,173 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 07:04:29,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 07:04:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2019-12-27 07:04:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 07:04:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2019-12-27 07:04:29,180 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 37 [2019-12-27 07:04:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:29,181 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2019-12-27 07:04:29,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2019-12-27 07:04:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:29,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:29,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:29,183 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-27 07:04:29,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:29,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207554434] [2019-12-27 07:04:29,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:29,318 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:04:29,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207554434] [2019-12-27 07:04:29,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:29,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:29,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996547500] [2019-12-27 07:04:29,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:29,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:29,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:29,322 INFO L87 Difference]: Start difference. First operand 350 states and 632 transitions. Second operand 3 states. [2019-12-27 07:04:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:29,334 INFO L93 Difference]: Finished difference Result 350 states and 619 transitions. [2019-12-27 07:04:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:29,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:04:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:29,335 INFO L225 Difference]: With dead ends: 350 [2019-12-27 07:04:29,335 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 07:04:29,336 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:04:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 07:04:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-27 07:04:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 07:04:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 619 transitions. [2019-12-27 07:04:29,341 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 619 transitions. Word has length 52 [2019-12-27 07:04:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:29,343 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 619 transitions. [2019-12-27 07:04:29,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 619 transitions. [2019-12-27 07:04:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:04:29,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:29,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:29,345 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-27 07:04:29,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:29,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746336921] [2019-12-27 07:04:29,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:29,638 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:04:29,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746336921] [2019-12-27 07:04:29,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:29,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:04:29,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521749579] [2019-12-27 07:04:29,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:04:29,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:04:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:04:29,640 INFO L87 Difference]: Start difference. First operand 350 states and 619 transitions. Second operand 9 states. [2019-12-27 07:04:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:30,315 INFO L93 Difference]: Finished difference Result 541 states and 950 transitions. [2019-12-27 07:04:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:04:30,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 07:04:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:30,317 INFO L225 Difference]: With dead ends: 541 [2019-12-27 07:04:30,317 INFO L226 Difference]: Without dead ends: 541 [2019-12-27 07:04:30,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:04:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-12-27 07:04:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 438. [2019-12-27 07:04:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 07:04:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 774 transitions. [2019-12-27 07:04:30,324 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 774 transitions. Word has length 53 [2019-12-27 07:04:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:30,325 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 774 transitions. [2019-12-27 07:04:30,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:04:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 774 transitions. [2019-12-27 07:04:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:04:30,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:30,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:30,327 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1194206821, now seen corresponding path program 2 times [2019-12-27 07:04:30,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:30,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818332037] [2019-12-27 07:04:30,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:30,404 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:04:30,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818332037] [2019-12-27 07:04:30,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:30,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:30,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629837389] [2019-12-27 07:04:30,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:30,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:30,406 INFO L87 Difference]: Start difference. First operand 438 states and 774 transitions. Second operand 3 states. [2019-12-27 07:04:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:30,447 INFO L93 Difference]: Finished difference Result 437 states and 772 transitions. [2019-12-27 07:04:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:30,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:04:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:30,449 INFO L225 Difference]: With dead ends: 437 [2019-12-27 07:04:30,449 INFO L226 Difference]: Without dead ends: 437 [2019-12-27 07:04:30,449 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:04:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-27 07:04:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-12-27 07:04:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 07:04:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 608 transitions. [2019-12-27 07:04:30,454 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 608 transitions. Word has length 53 [2019-12-27 07:04:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:30,455 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 608 transitions. [2019-12-27 07:04:30,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 608 transitions. [2019-12-27 07:04:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:04:30,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:30,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:30,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-27 07:04:30,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:30,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772323022] [2019-12-27 07:04:30,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:30,592 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:04:30,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772323022] [2019-12-27 07:04:30,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:30,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:30,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47166879] [2019-12-27 07:04:30,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:04:30,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:04:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:30,595 INFO L87 Difference]: Start difference. First operand 349 states and 608 transitions. Second operand 7 states. [2019-12-27 07:04:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:30,712 INFO L93 Difference]: Finished difference Result 554 states and 969 transitions. [2019-12-27 07:04:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:04:30,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:04:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:30,713 INFO L225 Difference]: With dead ends: 554 [2019-12-27 07:04:30,713 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 07:04:30,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:04:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 07:04:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 07:04:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 07:04:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-27 07:04:30,719 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 54 [2019-12-27 07:04:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:30,719 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-27 07:04:30,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:04:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-27 07:04:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:04:30,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:30,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:30,721 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 2 times [2019-12-27 07:04:30,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:30,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408809286] [2019-12-27 07:04:30,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:30,901 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:04:30,901 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:04:30,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1613~0.base_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1613~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1613~0.base_19|) |v_ULTIMATE.start_main_~#t1613~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1613~0.base_19| 4)) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1613~0.base_19|) 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1613~0.base_19| 1)) (= v_~y$w_buff0_used~0_106 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z~0_9) (= v_~y$w_buff1_used~0_64 0) (= |v_ULTIMATE.start_main_~#t1613~0.offset_14| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_~#t1614~0.base=|v_ULTIMATE.start_main_~#t1614~0.base_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1614~0.offset=|v_ULTIMATE.start_main_~#t1614~0.offset_13|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ULTIMATE.start_main_~#t1613~0.base=|v_ULTIMATE.start_main_~#t1613~0.base_19|, ~y~0=v_~y~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, ULTIMATE.start_main_~#t1613~0.offset=|v_ULTIMATE.start_main_~#t1613~0.offset_14|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_~#t1614~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1614~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ULTIMATE.start_main_~#t1613~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1613~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:04:30,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1614~0.base_11| 1) |v_#valid_23|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1614~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1614~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1614~0.base_11|) |v_ULTIMATE.start_main_~#t1614~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1614~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1614~0.base_11|) (= |v_ULTIMATE.start_main_~#t1614~0.offset_10| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1614~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1614~0.offset=|v_ULTIMATE.start_main_~#t1614~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1614~0.base=|v_ULTIMATE.start_main_~#t1614~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1614~0.base] because there is no mapped edge [2019-12-27 07:04:30,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:04:30,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1956436533| |P0Thread1of1ForFork0_#t~ite3_Out-1956436533|)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1956436533 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1956436533 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-1956436533 |P0Thread1of1ForFork0_#t~ite3_Out-1956436533|)) (and .cse1 (= ~y~0_In-1956436533 |P0Thread1of1ForFork0_#t~ite3_Out-1956436533|) (or .cse2 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956436533, ~y$w_buff1~0=~y$w_buff1~0_In-1956436533, ~y~0=~y~0_In-1956436533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956436533} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956436533, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1956436533|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1956436533|, ~y$w_buff1~0=~y$w_buff1~0_In-1956436533, ~y~0=~y~0_In-1956436533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956436533} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:04:30,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1736105905 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1736105905 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1736105905|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1736105905 |P0Thread1of1ForFork0_#t~ite5_Out-1736105905|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1736105905, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1736105905} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1736105905|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1736105905, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1736105905} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:04:30,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1084730964 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1084730964 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1084730964 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1084730964 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1084730964|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1084730964 |P0Thread1of1ForFork0_#t~ite6_Out1084730964|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1084730964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084730964, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1084730964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1084730964} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1084730964|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1084730964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084730964, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1084730964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1084730964} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:04:30,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In800020939 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In800020939 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out800020939| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out800020939| ~y$r_buff0_thd1~0_In800020939) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In800020939, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In800020939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In800020939, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out800020939|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In800020939} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:04:30,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-393473829 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-393473829 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-393473829 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-393473829 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-393473829 |P0Thread1of1ForFork0_#t~ite8_Out-393473829|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-393473829|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-393473829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-393473829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-393473829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-393473829} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-393473829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-393473829, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-393473829|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-393473829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-393473829} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:04:30,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, 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_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:04:30,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-897028080 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-897028080 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-897028080|)) (and (= ~y$w_buff0_used~0_In-897028080 |P1Thread1of1ForFork1_#t~ite11_Out-897028080|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-897028080, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897028080} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-897028080, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897028080, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-897028080|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:04:30,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-26262519 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-26262519 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-26262519 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-26262519 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-26262519 |P1Thread1of1ForFork1_#t~ite12_Out-26262519|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-26262519|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-26262519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26262519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-26262519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26262519} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-26262519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26262519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-26262519, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-26262519|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26262519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:04:30,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-458874988 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-458874988 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-458874988 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-458874988 ~y$r_buff0_thd2~0_Out-458874988) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-458874988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458874988} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-458874988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-458874988, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-458874988|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:04:30,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In179177799 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In179177799 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In179177799 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In179177799 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out179177799|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out179177799| ~y$r_buff1_thd2~0_In179177799) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179177799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179177799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179177799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179177799} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179177799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179177799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179177799, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out179177799|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179177799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:04:30,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:04:30,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:04:30,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2059140037 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-2059140037 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-2059140037| ~y$w_buff1~0_In-2059140037)) (and (= |ULTIMATE.start_main_#t~ite17_Out-2059140037| ~y~0_In-2059140037) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2059140037, ~y~0=~y~0_In-2059140037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2059140037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2059140037} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2059140037|, ~y$w_buff1~0=~y$w_buff1~0_In-2059140037, ~y~0=~y~0_In-2059140037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2059140037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2059140037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 07:04:30,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 07:04:30,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In612412972 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In612412972 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out612412972|)) (and (= ~y$w_buff0_used~0_In612412972 |ULTIMATE.start_main_#t~ite19_Out612412972|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In612412972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In612412972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In612412972, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out612412972|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In612412972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:04:30,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1644675547 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1644675547 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1644675547 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1644675547 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1644675547| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out1644675547| ~y$w_buff1_used~0_In1644675547) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1644675547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1644675547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1644675547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1644675547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1644675547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1644675547, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1644675547|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1644675547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1644675547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:04:30,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-543750477 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-543750477 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-543750477| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-543750477| ~y$r_buff0_thd0~0_In-543750477)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-543750477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-543750477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-543750477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-543750477, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-543750477|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:04:30,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1562328153 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1562328153 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1562328153 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1562328153 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1562328153| ~y$r_buff1_thd0~0_In-1562328153) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1562328153| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562328153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1562328153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562328153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562328153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562328153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1562328153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562328153, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1562328153|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562328153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:04:30,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1522911669 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1522911669| ~y$w_buff1_used~0_In1522911669) (= |ULTIMATE.start_main_#t~ite37_In1522911669| |ULTIMATE.start_main_#t~ite37_Out1522911669|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite38_Out1522911669| |ULTIMATE.start_main_#t~ite37_Out1522911669|) (= ~y$w_buff1_used~0_In1522911669 |ULTIMATE.start_main_#t~ite37_Out1522911669|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1522911669 256)))) (or (= (mod ~y$w_buff0_used~0_In1522911669 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In1522911669 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1522911669 256)) .cse1))) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1522911669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1522911669, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1522911669|, ~weak$$choice2~0=~weak$$choice2~0_In1522911669, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1522911669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522911669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1522911669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1522911669, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1522911669|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1522911669|, ~weak$$choice2~0=~weak$$choice2~0_In1522911669, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1522911669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522911669} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:04:30,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 07:04:30,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:04:30,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:04:31,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:04:31 BasicIcfg [2019-12-27 07:04:31,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:04:31,059 INFO L168 Benchmark]: Toolchain (without parser) took 14563.97 ms. Allocated memory was 138.9 MB in the beginning and 680.5 MB in the end (delta: 541.6 MB). Free memory was 101.8 MB in the beginning and 336.6 MB in the end (delta: -234.8 MB). Peak memory consumption was 306.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,060 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.31 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 157.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.62 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 153.9 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:04:31,064 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,065 INFO L168 Benchmark]: RCFGBuilder took 838.10 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 107.2 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,066 INFO L168 Benchmark]: TraceAbstraction took 12931.24 ms. Allocated memory was 202.9 MB in the beginning and 680.5 MB in the end (delta: 477.6 MB). Free memory was 107.2 MB in the beginning and 336.6 MB in the end (delta: -229.4 MB). Peak memory consumption was 248.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:31,076 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.16 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 679.31 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 157.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.62 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.10 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 107.2 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12931.24 ms. Allocated memory was 202.9 MB in the beginning and 680.5 MB in the end (delta: 477.6 MB). Free memory was 107.2 MB in the beginning and 336.6 MB in the end (delta: -229.4 MB). Peak memory consumption was 248.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1229 SDtfs, 1142 SDslu, 1924 SDs, 0 SdLazy, 1140 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16072occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 9336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 46782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...